Generalized dominators for structured programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1145, Issue , 1996, Pages 42-51

  Alstrup, Stephen ^a   Lauridsen, Peter W ^a   Thorup, Mikkel ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DATA FLOW ANALYSIS; GRAPHIC METHODS; PROBLEM ORIENTED LANGUAGES; STATIC ANALYSIS;

BOUNDED TREEWIDTH; CONTROL FLOW ANALYSIS; CONTROL FLOW GRAPHS; FAST ALGORITHMS; LINEAR-TIME ALGORITHMS;

FLOW GRAPHS;

EID: 84957616968     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61739-6_32     Document Type: Conference Paper

References (17)

1. A.V. Aho, R. Sethi, and J.D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986.
2. S. Alstrup, J. Clausen, and K. Jørgensen. An 0(|Vj * jfî|) algorithm for finding immediate multiple-vertex dominators. Technical Report DIKU-TR-96/4, Depar- ment of Computer Science, University of Copenhagen, 1996. Revised version with minor change accepted to Information Processing Letters.
3. H. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In Proc. 25th ACM. Symp. on theory of Comp.(STOC'9S), pages 226- 234, 1993.
4. G.R. Gao, Y.-F Lee, and V.C. Sreedhar. DJ-graphs and their apphcation to flow- graph analyses. Technical Report 70, McGill University, School of Computer Science, ACAPS, May 1994.
5. G.R. Gao and V.C. Sreedhar. A linear time algorithm for placing Φ-nodes. In ACM Symp. on the Principles of Programming Languages (POPI95), volume 22, pages 62-73, January 1995.
6. R. Gupta. Generalized dominators and post-dominators. In ACM Symp. on Principles of Programming Languages (POPI92), volume 19, pages 246-257, 1992.
7. R. Gupta. Generalized dominators. Information processing letters, 53:193-200, 1995.
8. D. Harel. A linear time algorithm for finding dominator in flow graphs and related problems. In Proc. 17th Ann, ACM Symp. on theory of Comp. (STOC'85), pages 185-194, 1985.
9. M.S. Hecht and J.D. Ullman. A simple algorithm for global data flow analysis of programs. SIAM J. Comput., 4:519-532, 1975.
10. B.R. Kemighan and D.M. Ritchie. The C programming language. Prentice-Hall, New-Jersey, 1978.
11. T. Lengauer and R.E. Tarjan. A fast algorithm for finding dominators in a flow- graph. ACM Trans. Programming Languages Systems, 1:121-141, 1979.
12. P. Naur. Revised report on the algorithmic language algol 60. Comm. ACM, 1(6):1-17, 1963.
13. P.W. Purdom and E.F. Moore. Immediate predominators in a directed graph. Comm. ACM, 15(8):777-778, 1972.
14. R.E. Tarjan. Finding dominators in directed graphs. SIAM J. Comput., 3(1):62- 89, 1974.
15. M. Thorup. Structured programs have small tree-width and good register allocation. Technical Report DIKU-TR-95/18 (revised version), Deparment of Computer Science, University of Copenhage, 1995.
16. N. Wirth. The programming language pascal. Acta informatíca, 1:35-63, 1971.
17. N. Wirth. Programming in modula-2(3rd corr.ed). Springer-verlag, Berlin, New York, 1985.