Efficient context-sensitive pointer analysis for c programs

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn Part F129371, Issue , 1995, Pages 1-12

  Wilson, Robert P ^a   Lam, Monica S ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; PROGRAM COMPILERS;

CALLING CONTEXTS; COMPILER SYSTEMS; CONTEXT SENSITIVE; LOW LEVEL REPRESENTATION; MEMORY LOCATIONS; POINTER ANALYSIS; POINTER ARITHMETIC; TYPE SYSTEMS;

C (PROGRAMMING LANGUAGE);

EID: 84976692886     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/207110.207111     Document Type: Conference Paper

References (16)

1. D. R. Chase, M. Wegman, F. K. Zadcck. Analysis of Pointers and Structures. In Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation, pages 296-310, June 1990.
2. J.-D. Choi, M. Burke, P. 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, Jan. 1993.
3. R. Cytron,J. Ferrante, B. K. Rosen, M. N. Wegman, F. K. Zadeck. An Efficient Method of Computing Static Single Assignment Form. In Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages, pages 25-35, Jan. 1989.
4. A. Deutsch. Interprocedural May-Alias Analysis for Pointers: Beyond k-limiting. In Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation, pages 230-241, June 1994.
5. M. Emami. A Practical Interprocedural Alias Analysis for an Optimizing/Parallelizing C Compiler. Master's thesis, School of Computer Science, McGill University, Aug. 1993.
6. M. Emami, R. Ghiya, L. 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 andImplementation, pages 242-256, June 1994.
7. M. W. Hall, S. P. Amarasinghe, B. R. Murphy,and M. S. Lam. Interprocedural Analysis for Parallelization: Preliminary Results. Technical Report CSL-TR-95-665, Computer Systems Lab, Stanford University, Stanford, CA 94305-4055, Apr. 1995.
8. W. L. Harrison III. The Interprocedural Analysis and Automatic Parallelization of Scheme Programs. Lisp and Symbolic Computation, 2(3): 176-396, Oct. 1989.
9. L. J. Hendren. Parallelizing Programs with Recursive Data Structures. IEEE Transactions on Parallel and Distributed Systems, 1(1):35-47,Jan. 1990.
10. F. Irigoin, P. Jouvelot, R. Triolet. Semantical Interprocedural Parallelization: An Overview of the PIPS Project. In Proceedings of the 1991 ACM International Conference on Supercomputing, pages 254-251, June 1991.
11. N. Jones and S. Muchnick. Flow Analysis and Optimization of Lisp-like Structures. In S. Muchnick and N. Jones, editors, Program Flow Analysis: Theory and Applications, pages 102-131. Prentice Hall, 1979.
12. W. Landi and B. 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.
13. J. R. Larus and P. N. Hilfinger. Detecting Conflicts Between Structure Accesses. In Proceedings of the ACM SIGPLAN'88 Conference on Programming Language Design and Implementation, pages 21-34, June 1988.
14. T. J. Marlowe, W. A. Landi, B. G. Ryder, J. D. Choi, M. G. Burke, P. Carini. Pointer-Induced Aliasing: A Clarification. ACM SIGPLAN Notices, 28(9):67-70, Sept. 1993.
15. E. Ruf. Personal communication, Oct. 1994.
16. R. P. Wilson et al. SUIF: An Infrastructure for Research on Parallelizing and Optimizing Compilers. ACM SIGPLAN Notices, 29(12):31-37, Dec. 1994.