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 program 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 program transformations is guaranteed by the conservation of data flow. Professionals and researchers in software engineering, computer engineering, program design analysis, and compiler design will benefit from its presentation of data-flow methods and memory optimization of compilers.

A new book providing a detailed and current presentation of the program analysses and transformations that extract the flow of data in computer memory systems. The emphasis is on a framework for the optimization of code for imperative programs and greater computer systems efficiency. Professionals and researchers in software engineering, computer engineering, program design analysis, and compiler design will benefit from its presentation of data-flow methods and memory optimization of compilers.

Inhalt
Basic Concepts.- Describing Program Executions.- Labels.- Analyses and Transformations.- Revisiting Some Classical Compiler Concepts.- Reaching Definition Analysis.- Applications of Reaching Definition Analysis.- Some Classical Compiler Concepts, Part II.- Data Flow and Expansion.- Single-Assignment Forms.- Maximal Static Expansion.- Parallel Languages.- Conclusion: Toward Algorithm Recognition.