Communications of the ACM
BLISS: a language for systems programming
Communications of the ACM
A unified approach to global program optimization
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Analysis of a simple algorithm for global data flow problems
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Design of an Optimizing Compiler
The Design of an Optimizing Compiler
Global common subexpression elimination
Proceedings of a symposium on Compiler optimization
Global program optimizations.
Programming languages and their compilers: Preliminary notes
Programming languages and their compilers: Preliminary notes
| Hi-index | 0.00 |
Methods of compile-time program analysis for automatic code optimization usually include control flow analysis, in which possible execution flow paths are modeled, and data flow analysis, in which data relatiohsips are modeled. One representation of data relations in a program, via use-definition chains, is examined in the light of a particular example problem-the global elimination of ''useless'' computation. Two elimination algorithms which use differently organized use-definition chains are presented and compared for space complexity on two pathologically different families of flow graphs. Algorithms to compute chains of both varieties are also developed.