A New Framework for Elimination-Based Data Flow Analysis Using DJ Graphs

ACM Transactions on Programming Languages and Systems

Volumn 20, Issue 2, 1998, Pages 388-435

  Sreedhar, Vugranam C ^a   Gao, Guang R ^b   Lee, Yong Fong ^c  

^a HEWLETT PACKARD COMPANY   (United States)

^b UNIVERSITY OF DELAWARE   (United States)

^c INTEL CORPORATION   (United States)

Author keywords

Algorithms; D.3.4 Programming Languages : Processors compilers; DJ graphs; E.1 Data : Data Structures graphs; Exhaustive and incremental data flow analysis; Irreducible flowgraphs; Languages; Optimization; Reducible flowgraphs; Tarjan's interval; Trees

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; GRAPH THEORY; OPTIMIZATION; PROGRAM COMPILERS; COMPUTER PROGRAM LISTINGS;

DJ GRAPHS; PROGRAM FLOWGRAPHS; TARJAN INTERVAL;

DATA FLOW ANALYSIS;

IRREDUCIBLE FLOWGRAPHS; REDUCIBLE FLOWGRAPHS;

EID: 0032010237     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/276393.278523     Document Type: Article

References (28)

1. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading Mass.
2. ALLEN, F. E. AND COCKE, J. 1976. A program data flow analysis procedure. Commun. ACM 19, 3 (Mar.), 137-147.
3. BUCHSBAUM, A. L., SUNDAR, R., AND TARJAN, R. E. 1995. Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues. SIAM J. Comput. 42, 5 (Oct.).
4. BURKE, M. 1990. An interval-based approach to exhaustive and incremental interprocedural data-flow analysis. ACM Trans. Progam. Lang. Syst. 12, 3 (July), 341-395.
5. CARROLL, M. AND RYDER, B. G. 1988. Incremental data flow update via attribute and dominator updated. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on the Principles of Programming Languages. ACM, New York, 274-284.
6. CARROLL, M. D. 1988. Data flow update via dominator and attribute updates. Ph.D. thesis, Rutgers Univ., New Brunswick, NJ.
7. CYTRON, R. AND FERRANTE, J. 1995. Efficiently computing ø-nodes on-the-fly. ACM Trans. Progam. Lang. Syst. 17, 3 (May), 487-506.
8. 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. Progam. Lang. Syst. 13, 4 (Oct.), 452-490.
9. GRAHAM, S. L. AND WEGMAN, M. 1976. A fast and usually linear algorithm for global flow analysis. J. ACM 23, 1 (Jan.), 172-202.
10. HECHT, M. S. AND ULLMAN, J. D. 1974. Characterizations of reducible flow graphs. J. ACM 21, 3 (July), 367-375.
11. KILDALL, G. A. 1973. A unified approach to global program optimization. In Conference Record of the 1st ACM SIGPLAN-SIGACT Symposium on the Principles of Programming Languages. ACM, New York, 194-206.
12. LUCAS, J. M. 1990. Postorder disjoint set union is linear. SIAM J Comput 19, 5 (Oct.), 868-882.
13. MARLOWE, T. J. 1989. Data flow analysis and incremental iteration. Ph.D. thesis, Rutgers Univ., New Brunswick, NJ.
14. MARLOWE, T. J. AND RYDER, B. G. 1990a. An efficient hybrid algorithm for incremental data flow analysis. In Conference Record of the 17th Annual ACM SIGPLAN-SIGACT Symposium on the Principles of Programming Languages ACM, New York 184-196.
15. MARLOWE, T. J. AND RYDER, B. G. 1990b. Properites of data flow frameworks: A unified model. Acta Informatica 28, 121 163.
16. RAMALINGAM, G. AND REPS, T. 1994. An incremental algorithm for maintaining the dominator tree of a reducible flowgraph. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on the Principles of Programming Languages. ACM, New York.
17. REPS, T. 1982. Optimal-time incremental semantic analysis for syntax-directed editors. In Conference Record of the 9th Annual ACM Symposium on the Principles of Programming Languages. ACM, New York.
18. RYDER, B. G. AND PAULL, M. C. 1986. Elimination algorithms for data flow analysis. ACM Comput. Surv. 18, 3 (Sept.), 277-316.
19. SCHWARTZ, J. T. AND SHARIR, M. 1979. A design for optimizations of the bit-vectoring class. Tech. Rep. 17 (Sept.), Courant Institute of Mathematical Sciences, New York Univ. New York.
20. SREEDHAR, V. C. 1995. Efficient program analyses using DJ graphs. Ph.D. thesis, School of Computer Science, McGill Univ., Montreal, Canada.
21. SREEDHAR, V. C. AND GAO, G. R. 1995. A linear time algorithm for placing ø-nodes. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on the Principles of Programming Languages. ACM, New York.
22. SREEDHAR, V. C. AND GAO, G. R. 1995. Computing ø-nodes in linear time using DJ graphs. J. Program. Lang. 3, 4, 191-213.
23. SREEDHAR, V. C., GAO, G. R., AND LEE, Y. 1996. Identifying loops using DJ graphs. ACM Trans. Program. Lang. Syst. 18, 6 (Nov.), 649-658.
24. SREEDHAR, V. C., GAO, G. R., AND LEE, Y. 1997. Incremental computation of dominator trees. ACM Trans. Program. Lang. Syst. 19, 2 (Mar), 239-252.
25. TARJAN, R. E. 1981. Fast algorithms for solving path problems. J. ACM 28, 3 (July), 594-614.
26. TARJAN, R. E. AND VAN LEEUWEN, J. 1984. Worst-case analysis of set union algorithm. J. ACM 31, 2, 245-281.
27. TJIANG, S. W. K. AND HENNESSY, J. L. 1992. Sharlit - a tool for building optimizers. In Proceedings of the ACM SIGPLAN'92 Conference on Programming Language Design and Implementation. SIGPLAN Not. 27, 82-93.
28. ULLMAN, J. D. 1973. Fast algorithms for the elimination of common subexpressions. Acta Informatica 2, 3, 191-213.