Nesting of Reducible and Irreducible Loops

ACM Transactions on Programming Languages and Systems

Volumn 19, Issue 4, 1997, Pages 557-567

  Havlak, Paul ^a  

^a Rice University   (United States)

Author keywords

Algorithms; D.3.4 Programming Languages ; Languages; Processors compilers; Reducible loops; Strongly connected regions

Indexed keywords

ALGORITHMS; PROGRAM COMPILERS; TREES (MATHEMATICS);

LOOP NESTING TREES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0031186224     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/262004.262005     Document Type: Article

References (8)

1. AHO, A. V., SETHI, R. I., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques, and Tools, 2nd ed. Addison-Wesley, Reading, Mass.
2. BURKE, M. 1990. An interval-based approach to exhaustive and incremental interprocedural dataflow analysis. ACM Trans. Program. Lang. Syst. 12, 3 (July), 341-395.
3. HAVLAK, P. 1994. Interprocedural symbolic analsyis. Ph.D. thesis, Tech. Rep. CS-TR94-228, Dept. of Computer Science, Rice Univ., Houston, Tex.
4. LENGAUER, T. AND TARJAN, R. E. 1979. A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst. 1, 121-141.
5. SCHWARTZ, J. AND SHARIR, M. 1979. A design for optimizations of the bitvectoring class. Tech. rep., Courant Inst., New York Univ., New York. September.
6. SLOMAN, B., LAKE, T., AND WILLIAM, S. 1994. Identifying loops in flowgraphs. Tech. Rep. SEG/GN/94/1, Univ. of Reading, Reading, UK.
7. TARJAN, R. E. 1974. Testing flow graph reducibility. J. Comput. Syst. Sci. 9, 355-365.
8. TARJAN, R. E. 1983. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, Pa.