The book focuses on analyses that extract the flow of data, which imperative programming hides through its use and reuse of memory in computer systems and compilers. It details some programme transformations that conserve this data flow and introduces a family of analyses, called reaching definition analyses, to do this task. In addition, it shows that correctness of programme transformations is guaranteed by the conservation of data flow. Professionals and researchers in software engineering, computer engineering, program design analysis, and compiler design should benefit from its presentation of data-flow methods and memory optimization of compilers.
|Describing program executions|
|Revisiting some classical compiler concepts|
|Reaching defintion analysis|
|Applications of reaching definition analysis|
|Some classical compiler concepts, part II|
|Single assignment forms|
|Maximal static expansion|
|Toward algorithm recognition|
|Table of Contents provided by Publisher. All Rights Reserved.|
Number Of Pages: 238
Published: 16th October 2002
Publisher: Springer-Verlag New York Inc.
Country of Publication: US
Dimensions (cm): 23.5 x 15.5 x 1.27
Weight (kg): 1.21