A Fast and Usually Linear Algorithm for Global Flow Analysis

Journal of the ACM (JACM)

Volumn 23, Issue 1, 1976, Pages 172-202

  Graham, Susan L ^a   Wegman, Mark ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL PROGRAMMING;

COMPUTER PROGRAMMING;

EID: 0016883652     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321921.321939     Document Type: Article

References (29)

1. Aho, A.V., and Ullman, J.D. The Theory of Parsing, Translation, and Compiling Vol. II, Compiling. Prentice-Hall, Englewood Cliffs, N.J., 1973, Ch. 11.
2. Aho, A.V., and Ullman, J.D. Node listings for reducible flow graphs. Proc Seventh Annual ACM Symposium on Theory of Computing, May 1975, pp. 177-185.
3. Allen, F.E. Control flow analysis. ACM SIGPLAN Notices (newsletter) 5, 7 (July 1970), 1-19.
4. Angluin, D. Private communication, July 1974.
5. Cocke, J. Global common subexpression elimination. ACM SIGPLAN Notices (newsletter) 5, 7 (July 1970), 20-24.
6. Cocke, J., and Schwartz, J.T. Programming Languages and Their Compilers, second rev version. Courant Institute of Mathematical Sciences, New York University, New York, 1970, Ch. 6.
7. Floyd, R W. Assigning meanings to programs. Proc American Mathematical Society Symposia in Applied Mathematics, Vol. 19, 1967, pp. 19-32.
8. Fong, A., Kam, J., and Ullman, J D. Applications of lattice algebra to loop optimization Conf. Record of the Second ACM Symposium on Principles of Programming Languages, Jan. 1975, pp. 1-9.
9. Habary, F., Norman, R.Z., and Cartwright, D. Structural Models Wiley, New York, 1966, pp. 64-65.
10. Hecht, M.S., and Ullman, J.D. Flow graph reducibility. SIAM J. Comput. 1, 2 (June 1972), 188-202.
11. Hecht, M.S., and Ullman, J.D. Analysis of a simple algorithm for global flow problems. Conf. Record of the ACM Symposium on Principles of Programming Languages, Oct. 1973, pp. 207-217.
12. Hecht, M.S., and Ullman, J.D. Characterizations of reducible flow graphs J. ACM 21, 3 (July 1974), 367-375.
13. Hoare, C.A.R. An axiomatic basis for computer programming. Comm. ACM 12, 10 (Oct. 1969), 576-580, 583.
14. Kam, J, and Ullman, J D Global optimization problems and iterative algorithms. TR-146, Dep. of Elec. Eng., Princeton U., Princeton, N. J., Jan. 1974.
15. Kennedy, K. A. global flow analysis algorithm Int. J. of Computer Math. S (Dec. 1971), 5-15.
16. Kennedy, K A comparison of algorithms for global flow analysis. Rice Tech. Rep. 476-093-1, Rice U., Houston, Texas, Feb. 1974.
17. Kennedy, K W. Node listings applied to data flow analysis. Conf. Record of the Second ACM Symposium on Principles of Programming Languages, Jan. 1975, pp. 10-21.
18. Kildall, G.A. A unified approach to global program optimization. Conf. Record of the ACM Symposium on Principles of Programming Languages, Oct. 1973, pp. 194-206.
19. Paterson, M Unpublished memorandum U of Warwick, Coventry, England, April 1972.
20. Peterson, W W., Kasami, T., and Tokura, N. On the capabilities of while, repeat, and exit statements. Comm. ACM 16, 8 (Aug. 1973), 503-512.
21. Schaefer, M. A Mathematical Theory of Global Program Optimization. Prentice-Hall, Englewood Cliffs, N.J, 1973.
22. Tarjan, R.E. Depth-first search and linear graph algorithms. SIAM J. Comput 1, 2 (Sept 1972), 146-160.
23. Tarjan, R.E. Testing flow graph reducibility. Proc. 5th Annual ACM Symposium on Theory of Computing, May 1973, pp. 96-107.
24. Tarjan, R.E. Finding dominators in directed graphs. SIAM J. Comput. 3, 1 (March 1974), 62-89.
25. Tarjan, R.E. Efficiency of a good but not linear set union algorithm. J. ACM 22, 2 (April 1975), 215-225.
26. Ullman, J.D. Fast algorithms for the elimination of common subexpressions. Acta Informatica 2, 3 (Dec. 1973), 191-213.
27. Wegman, M. Ph.D. Dissertation, in preparation.
28. Wirth, N. The programming language PASCAL. Acta Informatica 1, 1 (1971), 35-63.
29. Wulf, W A. A case against the GOTO. ACM SIGPLAN Notices (newsletter) 7, 11 (Nov. 1972), 63-69.