Issue No. 03 - May (1977 vol. 3)
W.H. Harrison , IBM Thomas J. Watson Research Center
Programs can be analyzed to determine bounds on the ranges of values assumed by variables at various points in the program. This range information can then be used to eliminate redundant tests, verify correct operation, choose data representations, select code to be generated, and provide diagnostic information. Sophisticated analyses involving the proofs of complex assertions are sometimes required to derive accurate range information for the purpose of proving programs correct. The performance of such algorithms may be unacceptable for the routine analysis required during the compilation process. This paper presents a discussion of mechanical range analysis employing techniques practical for use in a compiler. This analysis can also serve as a useful adjunct to the more sophisticated techniques required for program proving.
Constant propagation, optimizing compiler, program analysis, proof of correctness, weak interpretation.
W. Harrison, "Compiler Analysis of the Value Ranges for Variables," in IEEE Transactions on Software Engineering, vol. 3, no. , pp. 243-250, 1977.