D. Callahan
- 1 F. Allen, M. Burke, P. Charles, R. Cytron, and J. Ferrante. An overview of the PTRAN analysis system for multiprocessing. In Proceedings of the First International Conference on Supercomputing, Springer- Verlag, Athens, Greece, 1987. Google Scholar
Digital Library
- 2 F. E. Allen. Interprocedural data flow analysis. In Proceedings IFIP Congrezs 7.4, North-Holland Publishing Co., Amsterdam, 1974.Google Scholar
- 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.Google Scholar
- 4 J. R. Allen, D. Baumgartner, K. Kennedy, and A. Portereld. PTOOL: a semi-automatic parallel programming assistant. In Proceedings o! the 1986 International Conference on Parallel Processing, IEEE Computer Society Press, August 1986.Google Scholar
- 5 J. It. 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.Google Scholar
- 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. Google ScholarDigital Library
- 7 D. Callahan, K. Cooper, K. Kennedy, and L. Torczon. interprocedural constant propagation, in Proceedings of the $IGPLAN '86 Symposium on Compiler Construction, June 1986. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 9 K. Cooper. Analyzing aliases of reference formal parameters. In Conference Record of the Twelfth A CM Symposium on the Principles of Programming Languages, January 1985. Google ScholarDigital Library
- 10 K. Cooper. Interprocedural Data Flow Analysis in a Programming Environment. PhD thesis, Dept. of Computer Science, Rice University, April 1983. Google ScholarDigital Library
- 11 K. Cooper and K. Kennedy. Efficient computation of flow insensitive interprocedural summary information. In Proceedings of the SIGPLAN '85 Symposium on Compiler Construction, SIGPLAN Notices Vol. 19, No. 6, July 1985. Google ScholarDigital Library
- 12 K. Cooper and K. Kennedy. Interprocedural sideeffect analysis in linear time. In Proceedings of the A CM SIGPLAN 88 Conference on Program Language Design and Implementation, Atlanta, GA, June 1988. Google ScholarDigital Library
- 13 K. Cooper, K. Kennedy, and L. Torczan. The impact of interprocedural analysis and optimization in the JR.n programming environment. A CM Transactions on Programming Languages and Systems, 8(4):419- 523, October 1986. Google ScholarDigital Library
- 14 S. Graham and M. Wegman. A fast and usually linear algorithm for global datg flow analysis. Journal of the A CM, January 1976. Google ScholarDigital Library
- 15 S. Horowitz, T. Reps, and D. Binkley. Interproccdural slicing using dependence graphs, in Proceedings of the A CM SIGPLAN 88 Conference on Program Language Design and Implementation, Atlanta, GA, June 1988. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 17 J. B. Kam and J. D. Ullman. Global data flow analysis and iterative algorithms. Journal of the A CM, 23(1):159-171, January 1976. Google ScholarDigital Library
- 18 K. Kennedy. Automatic translation of Fortran programs to vector form. Technical Report 476-029-4, Dept. of Mathematical Sciences, Rice University, October 1980.Google Scholar
- 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.Google Scholar
- 20 D. J. Kuck. The Structure of Computers and Computation. Volume 1, John Wiley & Sons, New York, 1978. Google ScholarDigital Library
- 21 D. Lomet. Data flow analysis in the presence of procedure calls. IBM Journal of Research and Development, 21(6):559-571, November 1977.Google ScholarDigital Library
- 22 E. Myers. A precise interprocedural data/tow algorithm. In Conference Record of the Eigth A CM Sttmposium on the Principles of Programming Languages, pages 219-230, January 1981. Google ScholarDigital Library
- 23 L. L. Pollock and M. L. Sofia. An incremental version of iterative data flow analysis. Rice COMP TR87-58, Dept. of Computer Science, Rice University, August 1987.Google Scholar
- 24 B. K. Rosen. Data flow analysis for procedural languages. Journal ojf the A CM, 26(2):322-344, April 1979. Google ScholarDigital Library
- 25 B. G. Ryder and M. D. Carroll. An incremental algorithm for software analysis. In Proceedinqs of the A CM SIGSOFT/$IGPLAN Symposium on Practical SoItware Development Environments, pages 171-179, 1986. Google Scholar
- 26 R. E. Tarjan. Fast algorithms for solving path problems. Journal of the ACM, 28(3):594-614, July 1981. Google ScholarDigital Library
- 27 R. Triolet, F. Irigion, and P. Feautrier. Direct parallelization of call statements. In Proceedings of the $IGPLAN '86 Slimposium on Compiler Construction, pages 176-185, June 1986. Google ScholarDigital Library
Index Terms
- The program summary graph and flow-sensitive interprocedual data flow analysis
Recommendations
Semi-sparse flow-sensitive pointer analysis
POPL '09Pointer analysis is a prerequisite for many program analyses, and the effectiveness of these analyses depends on the precision of the pointer information they receive. Two major axes of pointer analysis precision are flow-sensitivity and context-...
Precise and scalable context-sensitive pointer analysis via value flow graph
ISMM '13: Proceedings of the 2013 international symposium on memory managementIn this paper, we propose a novel method for context-sensitive pointer analysis using the value flow graph (VFG) formulation. We achieve context-sensitivity by simultaneously applying function cloning and computing context-free language reachability (...
Semi-sparse flow-sensitive pointer analysis
POPL '09: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesPointer analysis is a prerequisite for many program analyses, and the effectiveness of these analyses depends on the precision of the pointer information they receive. Two major axes of pointer analysis precision are flow-sensitivity and context-...
Comments