On loops, dominators, and dominance frontiers

ACM Transactions on Programming Languages and Systems

Volumn 24, Issue 5, 2002, Pages 455-490

  Ramalingam, G ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Algorithms; Data Structures graphs and networks; trees; Dominator; Graph Theory graph algorithms; trees; Graph transformation; Irreducible graph; Languages; Processors code generation; compilers; interpreters; incremental compilers; optimization

Indexed keywords

EID: 0038893942     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/570886.570887     Document Type: Article

References (26)

1. ALSTRUP, S., HAREL, D., LAURIDSEN, P. W., AND THORUP, M. 1999. Dominators in linear time. SIAM J. Comput. To appear.
2. ALSTRUP, S., LAURIDSEN, P. W., AND THORUP, M. 1996. Dominators in linear time. Tech. Rep. 96/35, Department of Computer Science, Univ. Copenhagen, Copenhagen, Denmark.
3. ALSTRUP, S. AND LAURIDSEN, P. W. 1996. A simple and optimal algorithm for finding immediate dominators in reducible graphs. Tech. Rep. D-261/96, TOPPS Bibliography.
4. BUCHSMAN, A. L., KAPLAN, H., ROGERS, A., AND WESTBROOK, J. 1998. A new, simpler linear-time dominators algorithm. ACM Trans. Program. Lang. Syst. 20, 6, 1265-1296.
5. CHOI, J.-D., CYTRON, R., AND FERRANTE, J. 1991. Automatic construction of sparse data flow evaluation graphs. In Conference Record of the 18th ACM Symposium on Principles of Programming Languages. ACM, New York, pp. 55-66.
6. CORMEN, T., LEISERSON, C., AND RIVEST, R. 1990. Introduction to Algorithms. MIT Press, Cambridge, Mass.
7. 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.
8. CYTRON, R., LOWRY, A., AND ZADECK, F. K. 1986. Code motion of control structures in high-level languages. In Conference Record of the 13th ACM Symposium on Principles of Programming Languages. ACM, New York, pp. 70-85.
9. GABOW, H. N. 1990. Data structure for weighted matching and nearest common ancestors with linking. In Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 434-443.
10. HAREL, D. 1985. A linear time algorithm for finding dominators in flow graphs and related problems. In Proceedings of 17th ACM Symposium on Theory of Computing. ACM, New York, pp. 185-194.
11. HAVLAK, P. 1997. Nesting of reducible and irreducible loops. ACM Trans. Program. Lang. Syst. 19, 4 (July), 557-567.
12. LENGAUER, T. AND TARJAN, R. E. 1979. A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst. 1, 121-141.
13. MEHLHORN, K. AND TSAKALIDIS, A. 1990. Data structures. In Handbook of Theoretical Computer Science: Volume A (Algorithms and Complexity), J. van Leeuwen, Ed. MIT Press, 328-329.
14. MORGAN, R. 1998. Building an Optimizing Compiler. Butterworth-Heinemann, Woburn, Mass.
15. PINGALI, K. AND BILARDI, G. 1997. Optimal control dependence computation and the roman chariots problem. ACM Trans. Program. Lang. Syst. 19, 3 (May), 462-491.
16. RAMALINGAM, G. 1999. Identifying loops in almost linear time. ACAM Trans. Program. Lang. Syst. 21, 2, 175-188.
17. RAMALINGAM, G. AND REPS, T. 1994. An incremental algorithm for maintaining the dominator tree of a reducible flowgraph. In Conference Record of the 21st ACM Symposium on Principles of Programming Languages. ACM, New York, pp. 287-298.
18. REIF, J. H. AND LEWIS, H. R. 1977. Symbolic evaluation and the global value graph. In Conference Record of the 4th ACM Symposium on Principles of Programming Languages (Los Angeles, Calif.), ACM, New York, pp. 104-118.
19. SREEDHAR, V. C. 1995. Efficient program analysis using DJ graphs. Ph.D. dissertation. School of Computer Science, McGill Univ., Montréal, Québec, Canada.
20. SREEDHAR, V. C. AND GAO, G. 1995. A linear time algorithm for placing φ-nodes. In Conference Record of the 22nd ACM Symposium on Principles of Programming Languages ACM New York, pp. 62-73.
21. SREEDHAR, V. C., GAO, G. R., AND LEE, Y-F. 1996. Identifying loops using DJ graphs. ACM Trans. Program. Lang. Syst. 18, 6 (Nov.), 649-658.
22. STEENSGAARD, B. 1993. Sequentializing program dependence graphs for irreducible programs. Tech. Rep. MSR-TR-93-14, Microsoft Research, Redmond, Wash.
23. TARJAN, R. E. 1974. Testing flow graph reducibility. J. Comput. Syst. Sci. 9, 355-365.
24. TARJAN, R. E. 1979. Applications of path compression on balanced trees. J. ACM 26, 4, 690-715.
25. TARJAN, R. E. 1983. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA.
26. WEISS, M. 1992. The transitive closure of control dependence: The iterated join. ACM Lett. Program. Lang. Syst. 1, 2, 178-190.