Reasoning about program transformations : imperative programming and flow of data /
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 a...
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
New York :
Springer,
2003
New York : c2003 New York : [2003] |
| Subjects: |
Table of Contents:
- 1 Introduction
- I. Basic Concepts
- 2. Describing Program Executions
- 3. Labels
- II. Analyses and Transformations
- 4. Revisiting Some Classical Compiler Concepts
- 5. Reaching Definition Analysis
- 6. Applications of Reaching Definition Analysis
- 7. Some Classical Compiler Concepts, Part II
- III. Data Flow and Expansion
- 8. Single-Assignment Forms
- 9. Maximal Static Expansion
- 10. Parallel Languages
- 11. Conclusion: Toward Algorithm Recognition.
- 1 Introduction
- I. Basic Concepts
- 2. Describing Program Executions
- 3. Labels
- II. Analyses and Transformations
- 4. Revisiting Some Classical Compiler Concepts
- 5. Reaching Definition Analysis
- 6. Applications of Reaching Definition Analysis
- 7. Some Classical Compiler Concepts, Part II
- III. Data Flow and Expansion
- 8. Single-Assignment Forms
- 9. Maximal Static Expansion
- 10. Parallel Languages
- 11. Conclusion: Toward Algorithm Recognition.