A program form based on data dependency in predicate regions
Jeanne Ferrante, Karl J. Ottenstein · ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) · 1983
A new program representation is presented which permits certain optimizations to be performed at less expense than with other forms. This paper describes code motion, common subexpression elimination and induction variable detection. Scalar propagation and constant folding are sketched here, but detailed elsewhere. The powerful code motion strategy allows entire regions of the program to be moved. The representation described may be used as a compiler intermediate form or simply as a model for program analysis. It has great potential for use in translation for parallel machines.
Cited by 29 works. doi:10.1145/567067.567089
Authors
References
- Principles of Compiler Design
- Register allocation via coloring
- Flow Analysis of Computer Programs
- The Structure of Computers and Computations
- Dependence graphs and compiler optimizations
- Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
- Programming languages and their compilers: Preliminary notes
- Data Flow Supercomputers
- Property extraction in well-founded property sets
- The design of an optimizing compiler