Incremental Computation of Dominator Trees

ACM Transactions on Programming Languages and Systems

Volumn 19, Issue 2, 1997, Pages 239-252

  Sreedhar, Vugranam C ^a   Gao, Guang R ^b   Lee, Yong Fong ^c  

^a HEWLETT PACKARD COMPANY   (United States)

^b MCGILL UNIVERSITY   (Canada)

^c INTEL CORPORATION   (United States)

Author keywords

Algorithms; D.3.4 Programming Languages : Processors compilers; DJ graphs; Dominance frontiers; Dominator trees; E.1 Data : Data Structures graphs; Incremental compilation; Languages; Optimization; Trees

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; TREES (MATHEMATICS);

CAROLL RYDER ALGORITHM; DOMINATOR TREES; FLOWGRAPHS; RAMALINGAM REPS ALGORITHM;

PROGRAM COMPILERS;

EID: 0031102751     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/244795.244799     Document Type: Article

References (15)

1. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading Mass.
2. ALPERN, B., HOOVER, R., ROSEN, B., SWEENEY, B. K., AND ZADECK, F. K. 1990. Incremental evaluation of computational circuits. In Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 32-42.
3. CARROLL, M. AND RYDER, B. G. 1988. Incremental data flow update via attribute and dominator updates. In the ACM SIGPLAN-SIGACT Symposium on the Principles of Programming Languages. ACM, New York, 274-284.
4. CYTRON, R. AND FERRANTE, J. 1995. Efficiently computing φ-nodes on-the-fly. ACM Trans. Program. Lang. Syst. 17, 3 (May), 487-506.
5. CYTRON, R., FERRANTE, J., ROSEN, B. K., WEGMAN, M. N., AND ZADECK, F. K. 1991. Efficiently computing static single assignment form and control dependence graph. ACM Trans. Program. Lang. Syst. 13, 4 (Oct.), 452-490.
6. HAREL, D. 1985. A linear time algorithm for finding dominators in flow graphs and related problems. In the Symposium on Theory of Computing. ACM, New York, 185-194.
7. JOHNSON, R. 1994. Dependence based program analysis. Ph.D. thesis, Cornell Univ., Ithaca, N.Y.
8. POLLOCK, L. AND SOFFA, M. L. 1989. An incremental version of iterative data flow analysis. IEEE Trans. Softw. Eng. 15, 12 (Dec.), 1537-1549.
9. PURDOM, P. W. J. AND MOORE, E. F. 1972. Algorithm 430: Immediate predominators in a directed graph. Commun. ACM 15, 8 (Aug.), 777-778.
10. RAMALINGAM, G. AND REPS, T. 1994. An incremental algorithm for maintaining the dominator tree of a reducible flowgraph. In the ACM SIGPLAN-SlGACT Symposium on the Principles of Programming Languages. ACM, New York.
11. RYDER, B. G., MARLOWE, T. G., AND PAULL, M. C. 1988. Conditions for incremental iteration: Examples and counterexamples. Sci. Comput. Program. 11, 1 (Oct.), 1-15.
12. SREEDHAR, V. C. 1995. Efficient program analyses using DJ graphs. Ph.D. thesis, School of Computer Science, McGill Univ., Montreal, Canada.
13. SREEDHAR, V. C. AND GAO, G. R. 1996. Computing φ-nodes in linear time using DJ graphs. J. Program. Lang. 3, 4, 191-213.
14. SREEDHAR, V. C., GAO, G. R., AND LEE, Y. 1996. A new framework for exhaustive and incremental data flow analysis using DJ graphs. In Proceedings of the SIGPLAN'96 Conference on Programming Language Design and Implementation. ACM, New York, 278-290.
15. ZADECK, F. K. 1984. Incremental data flow analysis in a structured program editor. In Proceedings of the SIGPLAN '84 Symposium on Compiler Construction. SIGPLAN Not. 19, 6 (June), 132-143.