The Program Summary Graph and Flow-sensitive Interprocedual Data Flow Analysis

ACM SIGPLAN Notices

Volumn 23, Issue 7, 1988, Pages 47-56

  Callahan, David ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976758087     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/960116.53995     Document Type: Article

References (27)

1. F. Allen, M. Burke, P. Charles, R. Cytron, and J. Fer-rante. An overview of the PTRAN analysis system for multiprocessing. In Proceedings of the First International Conference on Supercomputing, Springer-Verlag, Athens, Greece, 1987.
2. F. E. Allen. Interprocedural data flow analysis. In Proceedings IFIP Congress 74, North-Holland Publishing Co., Amsterdam, 1974.
3. F. E. Allen and J. T. Schwartz. Determining the data relationships in a collection of procedures. Research Report RC 4989, IBM T. J. Watson Research Center, August 1974.
4. J. R. Allen, D. Baumgartner, K. Kennedy, and A. Porterfleld. PTOOL: a semi-automatic parallel programming assistant. In Proceedings of the 1986 International Conference on Parallel Processing, IEEE Computer Society Press, August 1986.
5. J. R. Allen and K. Kennedy. PFC: a program to convert Fortran to parallel form. Technical Report MASC-TR 82-6, Dept. of Mathematical Sciences, Rice University, March 1982.
6. M. Burke and R. Cytron. Interprocedural dependence analysis and parallelization. In Proceedings of the SIGPLAN ’86 Symposium on Compiler Construction, pages 162–175, June 1986.
7. D. Callahan, K. Cooper, K. Kennedy, and L. Torczon. Interprocedural constant propagation. In Proceedings of the SIGPLAN ’86 Symposium on Compiler Construction, June 1986.
8. D. Callahan and K. Kennedy. Analysis of interprocedural side effects in a parallel programming environment. In Proceedings of the First International Conference on Supercomputing, Springer-Verlag, Athens, Greece, 1987. Available as Rice University, Department of Computer Science Technical Report TR87-56, July 1987.
9. K. Cooper. Analyzing aliases of reference formal parameters. In Conference Record of the Twelfth ACM Symposium on the Principles of Programming Languages, January 1985.
10. K. Cooper. Interprocedural Data Flow Analysis in a Programming Environment. PhD thesis, Dept. of Computer Science, Rice University, April 1983.
11. K. Cooper and K. Kennedy. Efficient computation of flow insensitive interprocedural summary information. In Proceedings of the SIGPLAN ’84 Symposium on Compiler Construction, SIGPLAN Notices Vol. 19, No. 6, July 1985.
12. K. Cooper and K. Kennedy. Interprocedural side-effect analysis in linear time. In Proceedings of the ACM SIGPLAN 88 Conference on Program Language Design and Implementation, Atlanta, GA, June 1988.
13. K. Cooper, K. Kennedy, and L. Torczan. The impact of interprocedural analysis and optimization in the IRn programming environment. ACM Transactions on Programming Languages and Systems, 8(4):419– 523, October 1986.
14. S. Graham and M. Wegman. A fast and usually linear algorithm for global data flow analysis. Journal of the ACM, January 1976.
15. S. Horowitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. In Proceedings of the ACM SIGPLAN 88 Conference on Program Language Design and Implementation, Atlanta, GA, June 1988.
16. P. Hudak. A semantic model of reference counting and its abstraction. In Conference Record of the 1986 Symposium on Lisp and Functional Programming, pages 351–363, 1986.
17. J. B. Kam and J. D. Ullman. Global data flow analysis and iterative algorithms. Journal of the ACM, 23(1):159–171, January 1976.
18. K. Kennedy. Automatic translation of Fortran programs to vector form. Technical Report 476-029-4, Dept. of Mathematical Sciences, Rice University, October 1980.
19. K. Kennedy. A survey of data flow analysis techniques. In S. S. Muchnick and M. D. Jones, editors, Program Flow Analysis: Theory and Applications, pages 1–54, Prentice-Hall,New Jersey, 1981.
20. D. J. Kuck. The Structure of Computers and Computation. Volume 1, John Wiley & Sons, New York, 1978.
21. D. Lomet. Data flow analysis in the presence of procedure calls. IBM Journal of Research and Development, 21(6):559–571, November 1977.
22. E. Myers. A precise interprocedural data flow algorithm. In Conference Record of the Eigth ACM Symposium on the Principles of Programming Languages, pages 219–230, January 1981.
23. L. L. Pollock and M. L. Soffa. An incremental version of iterative data flow analysis. Rice COMP TR87-58, Dept. of Computer Science, Rice University, August 1987.
24. B. K. Rosen. Data flow analysis for procedural languages. Journal of the ACM, 26(2):322–344, April 1979.
25. B. G. Ryder and M. D. Carroll. An incremental algorithm for software analysis. In Proceedings of the ACM SIGSOFT/SIGPLAN Symposium on Practical Software Development Environments, pages 171–179, 1986.
26. R. E. Tarjan. Fast algorithms for solving path problems. Journal of the ACM, 28(3):594–614, July 1981.
27. R. Triolet, F. Irigion, and P. Feautrier. Direct parallelization of call statements. In Proceedings of the SIGPLAN ’86 Symposium on Compiler Construction, pages 176–185, June 1986.