Efficient Computation of Flow Insensitive Interprocedural Summary Information

ACM SIGPLAN Notices

Volumn 19, Issue 6, 1984, Pages 247-258

  Cooper, Keith D ^a   Kennedy, Ken ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976666650     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/502949.502898     Document Type: Article

References (18)

1. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, Ma., 1974.
2. J. Banning, “A Method for Determining the Side Effects of Procedure Calls”, PhD Dissertation, Stanford University, Aug. 1978.
3. J. Barth, “A Practical Interprocedural Data Flow Analysis Algorithm”. CACM Vol. 21, No. 9, Sept. 1978, pp. 724-736.
4. M. Burke, Private Communication, November 1983.
5. K. Cooper, “Interprocedural Data Flow Analysis in a Programming Environment”, PhD Dissertation, Rice University, May 1983.
6. R. Farrow, K. Kennedy, and L. Zucconi, “Graph Grammars and Global Program Flow Analysis”, Proc. 17th Ann. IEEE Symp. on Foundations of Computer Science, Houston, Tx, November 1975.
7. S. Graham and M. Wegman, “A Fast and Usually Linear Algorithm for Global Flow Analysis”, JACM Vol. 23, No. 1, January 1976, pp. 172-202.
8. J. Hennessy, “Program Optimization and Exception Handling”. Proceedings 8th PQPL, Jan. 1981.
9. R. Hood and K. Kennedy, “A Programming Environment for Fortran”, Rice University, Department of Computer Science Technical Report, in preparation.
10. J. Kam and J. Ullman, “Global Data Flow Analysis and Iterative Algorithms”, JACM, Vol. 23, No.1, Jan. 1976, pp. 158-171.
11. R. Hood, and K. Kennedy, “A Programming Environment for Fortran”, Rice University, Department of Mathematical Sciences TR83-22, 1983.
12. E. Myers, “A Precise and Efficient Algorithm for Determining Existential Summary Data Flow Information”, University of Colorado at Boulder, Department of Computer Science Technical Report #CU-CS-175-80.
13. E. Myers, “A Prccise Intcrprocedural Data Flow Algorithm”, Proceedings 8th POPL, Jan. 1981.
14. B. Rosen, “Data Flow Analysis for Procedural Languages”, JACM, Vol. 26, No. 2, April 1979, pp. 322-344.
15. T. Spillman, “Exposing Side-Effects in a PL/I Optimizing Compiler”, IFIPS Proceedings, 1971, pp 376-381.
16. R. Tarjan, “Applications of Path Compression on Balanced Trees” JACM, Vol. 26, No. 4, Oct. 1979, pp. 690-715.
17. R. Tarjan, “A Unified Approach to Path Problems”, JACM, Vol. 28, No. 3, July 1981, pp. 577-593-
18. R. Tarjan, “Fast Algorithms for Solving Path Problems”, JACM, Vol. 28, No. 3, July 1981, pp. 594-614.