Identifying Loops Using DJ Graphs

ACM Transactions on Programming Languages and Systems

Volumn 18, Issue 6, 1996, Pages 649-658

  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; optimization; DJ graphs; Dominator trees; E.1 Data : Data Structures Graphs; Irreducible flowgraphs; Languages; Reducible flowgraphs; Tarjan's interval; Trees

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; FLOWCHARTING; GRAPHIC METHODS; OPTIMIZATION; PROGRAM COMPILERS; PROGRAM PROCESSORS;

DJ GRAPHS; DOMINATOR TREES; IRREDUCIBLE FLOWGRAPHS; LOOP IDENTIFICATION; LOOPS; REDUCIBLE FLOWGRAPHS; TARJAN INTERVAL;

DATA STRUCTURES;

EID: 0030286489     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/236114.236115     Document Type: Article

References (11)

1. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading Mass.
2. HECHT, M. S. 1977. Flow Analysis of Computer Programs. Elsevier North-Holland, Amsterdam.
3. HECHT, M. S. AND ULLMAN, J. D. 1974. Characterizations of reducible flow graphs. J. ACM 21, 3 (July), 367-375.
4. SREEDHAR, V. C. 1995. Efficient program analyses using DJ graphs. Ph.D. thesis, School of Computer Science, McGill Univ., Montreal, Canada.
5. SREEDHAR, V. C. AND GAO, G. R. 1995. A linear time algorithm for placing φ-nodes. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York.
6. SREEDHAR, V. C., GAO, G. R., AND LEE, Y. 1995. Incremental computation of dominator trees. In the ACM SIGPLAN Workshop on Intermediate Representation. SIGPLAN Not. 30, 4.
7. 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.
8. STEENSGARD, B. 1993. Sequentializing program dependence graphs for irreducible programs. Tech. Rep. MSR-TR-93-14, Microsoft Research, Redmond, Wash. Oct.
9. TARJAN, R. E. 1974. Testing flow graph reducibility. J Comput. Syst. Sci. 9, 355-365.
10. TARJAN, R. E. 1981. Fast algorithms for solving path problems. J. ACM 28, 3 (July), 594-614.
11. WOLFE, M. 1992. Flow graph anomalies: What's in a loop? Tech. Rep. CS/E 92-012, Oregon Graduate Inst. for Science and Technology, Portland, Oreg.