Automatic construction of sparse data flow evaluation graphs
Jong-Deok Choi, Ron K. Cytron, Jeanne Ferrante · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 1991
In this paper, we present an algorithm that con-structs sparse evaluation graphs for forward or backward monotone data flow problems. The sparse graph combines information as early as possible, yet directly connects nodes that generate and use information. This allows problems from the large, general class of monotone data flow problems to err joy the advantages of solutions based on Static Single Assignment (SSA) form. 1
Cited by 194 works. doi:10.1145/99583.99594
Authors
References
- Compilers: Principles, Techniques, and Tools
- The program dependence graph and its use in optimization
- A unified approach to global program optimization
- Flow Analysis of Computer Programs
- Efficiently computing static single assignment form and the control dependence graph
- A fast algorithm for finding dominators in a flowgraph
- Constant propagation with conditional branches
- An efficient method of computing static single assignment form
- Data Flow Analysis for Procedural Languages
- Detecting equality of variables in programs