Reasoning About Program Transformations Imperative Programming and Flow of Data /
Overview The motivation of this text lies in what we believe is the inadequacy of current frameworks to reason about the ?ow of data in imperative programs. This inadequacy clearly shows up when dealing with the individual side effects of loop iterations. - deed, we face a paradoxical situation wher...
| Corporate Author: | |
|---|---|
| Other Authors: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
New York, NY :
Springer New York,
2003.
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Table of Contents:
- 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.