The text contains a detailed and current presentation of the program analyses 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. In addition, the author 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.
|Publisher:||Springer New York|
|Edition description:||Softcover reprint of the original 1st ed. 2003|
|Product dimensions:||6.10(w) x 9.25(h) x 0.24(d)|
Table of Contents* Introduction * Describing program executions * Labels * 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 * Parallel languages * Toward algorithm recognition * References * Index