Identifying loops in almost linear time

ACM Transactions on Programming Languages and Systems

Volumn 21, Issue 2, 1999, Pages 175-188

  Ramalingam, G ^a  

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

Author keywords

Irreducible flowgraphs; Loops

Indexed keywords

LOOP IDENTIFICATION;

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; OPTIMIZATION; PROGRAM COMPILERS; TREES (MATHEMATICS);

IDENTIFICATION (CONTROL SYSTEMS);

EID: 0005083632     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/316686.316687     Document Type: Article

References (10)

1. AHO, A., SETHI, R., AND ULLMAN, J. 1986. Compilers. Principles, Techniques and Tools. Addison-Wesley, Reading, MA.
2. CORMEN, T., LEISERSON, C., AND RIVEST, R. 1990. Introduction to Algorithms. MIT Press, Cambridge, MA.
3. HAVLAK, P. 1997. Nesting of reducible and irreducible loops. ACM Trans. Program. Lang. Syst. 19, 4 (July), 557-567.
4. HOPCROFT, J. E. AND TARJAN, R. E. 1973. Efficient algorithms for graph manipulation. Commun. ACM 16, 6, 372-378.
5. RAMALINGAM, G. 1999. On loops, dominators, and dominance frontiers. Tech. Rep. RC21513, IBM Research Division. June.
6. 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.
7. STEENSGAARD, B. 1993. Sequentializing program dependence graphs for irreducible programs. Tech. Rep. MSR-TR-93-14, Microsoft Research, Redmond, Wash. Oct.
8. TARJAN, R. E. 1974. Testing flow graph reducibility. J. Comput. Syst. Sci. 9, 355-365.
9. TARJAN, R. E. 1979. Applications of path compression on balanced trees. J. ACM 26, 4, 690-715.
10. TARJAN, R. E. 1983. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA.