附註:Includes bibliographical references (pages 229-235) and index.
Introduction -- Describing program executions -- Labels -- Revisiting some classical compiler concepts -- Reaching definition analysis -- Applications of reaching definition analysis -- Some classical compiler concepts, part II -- Single assignment forms -- Maximal static expansion -- Toward algorithm recognition.
摘要: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.
