DocumentCode
748285
Title
Compiler Analysis of the Value Ranges for Variables
Author
Harrison, William H.
Author_Institution
IBM Thomas J. Watson Research Center
Issue
3
fYear
1977
fDate
5/1/1977 12:00:00 AM
Firstpage
243
Lastpage
250
Abstract
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.
Keywords
Constant propagation, optimizing compiler, program analysis, proof of correctness, weak interpretation.; Algorithm design and analysis; Data flow computing; Flow graphs; Information analysis; Optimizing compilers; Performance analysis; Testing; Tires; Tracking loops; Constant propagation, optimizing compiler, program analysis, proof of correctness, weak interpretation.;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/TSE.1977.231133
Filename
1702432
Link To Document