Context-sensitive inter procedural analysis in the presence of dynamic aliasing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1239, Issue , 1997, Pages 101-119

  Sathyanathan, Patrick W ^a   Lam, Monica S ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; DATA TRANSFER; MAPPING; PROGRAM COMPILERS; TRANSFER FUNCTIONS;

ABSTRACT DOMAINS; CALLING CONTEXTS; CONSTANT PROPAGATION; CONTEXT SENSITIVE; CONTEXT SENSITIVE SOLUTIONS; CONTEXT SENSITIVITY; INTER-PROCEDURAL; INTER-PROCEDURAL ANALYSIS;

DATA FLOW ANALYSIS;

EID: 84957650021     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0017248     Document Type: Conference Paper

References (14)

1. Michael Burke, Paul Carini, Jong-Deok Choi, and Michael Hind. Flow-insensitive interprocedural alias analysis in the presence of function pointers. In K. Pingali, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Lecture Notes in Computer Science, 892, pages 234-250. Springer-Verlag, 1995. Proceedings from the 7th International Workshop on Languages and Compilers for Parallel Computing. Extended version published as Research Report RC-19546, IBM T. J. Watson Research Center, September, 1994.
2. Jong-Deok Choi, Michael Burke, and Paul Carini. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In Proceedings of the 20th Annual ACM Symposium on Principles of Programming Languages, pages 232-245, January 1993.
3. Jong-Deok Choi, Ron Cytron, and Jeanne Ferrante. Automatic construction of sparse data flow evaluation graphs. In Proceedings of the 18th Annual ACM Symposium on Principles of Programming Languages, pages 55-66, January 1991.
4. David Callahan, Keith D. Cooper, Ken Kennedy, and Linda Torczon. Interprocedural constant propagation. In Proceedings of the ACM SIGPLAN'86 Symposium on Compiler Construction, pages 152-161, July 1986.
5. Paul R. Carini and Michael Hind. Flow-sensitive interprocedural constant propagation. Technical Report RC 20290, IBM Research Division, T.J. Watson Research Center, 1995.
6. Paul R. Carini, Harini Srinivasan, and Michael Hind. Flow-sensitive type analysis for c++. Technical Report RC 20267, IBM Research Division, T.J. Watson Research Center, 1995.
7. Maryam Emami, Rakesh Ghiya, and Laurie J. Hendren. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation, pages 242-256, June 1994.
8. Rakesh Ghiya. Practical techniques for interprocedural heap analysis. Master's thesis, School of Computer Science, McGill University, March 1995.
9. William Landi and Barbara G. Ryder. A safe approximate algorithm for interprocedural pointer aliasing. In Proceedings of the ACM SIGPLAN'92 Conference on Programming Language Design and Implementation, pages 235-248, June 1992.
10. Thomas Lengauer and Robert E. Tarjan. A fast algorithm for finding dominators in a flow-graph. ACM Transactions on Programming Languages and Systems, 1(1):121-141, July 1979.
11. M. Sharir and A. Pnueli. Two approaches to interprocedural data-flow analyis. In S.S. Muchnick and N. D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7, pages 189-234. Prentice-Hall, 1981.
12. Robert E. Tarjan. Fast algorithms for solving path problems. Journal of the ACM, 28(3):594-614, July 1981.
13. J. D. Ullman and M. S. Hecht. A simple algorithm for global fata flow analysis. SIAM J. Computing, 4:519-532, 1975.
14. Robert P. Wilson and Monica S. Lam. Efficient context-sensitive pointer analysis for C programs. In Proceedings of the ACM SIGPLAN'95 Conference on Programming Language Design and Implementation, pages 1-12, June 1995.