Context-sensitive interprocedural points-to analysis in the presence of function pointers

ACM SIGPLAN Notices

Volumn 29, Issue 6, 1994, Pages 242-256

  Emami, Maryam ^a   Ghiya, Rakesh ^a   Hendren, Laurie J ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976840386     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/773473.178264     Document Type: Article

References (42)

1. J. P. Banning. An efficient way to find the side effects of procedure calls and the aliases of variables. In Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages. pages 29-41, January 1979.
2. J. M. Barth. An interprocedural data flow analysis algorithm. In Conference Record of the Fourth A CM Symposium on Principles of Programming Languages, pages 119-131, January 1977.
3. D. Callahan, A. Carle, M. W. Hall, and K. Kennedy. Constructing the procedure call multigraph. IEEE Transactions on Software Engineering 16,4, pages 483-487, April 1990.
4. C. Chambers and D. Ungar. Customization: Optimizing compiler technology for SELF, a dynamically-typed object-oriented programming language. In Proceedings of the SIGPLAN ‘89 Symposium on Programming Language Design and Implementation, pages 146-160, June 1989.
5. C. Chambers and D. Ungar. Iterative type analysis and extended message splitting: Optimizing dynamically-typed object-oriented programs. In Proceedings of the SIGPLAN ‘90 Symposium on Programming Language Design and Implementation, pages 150-164, June 1990.
6. D. R. Chase, M. Wegman, and F. K. Zadeck. Analysis of pointers and structures. In Proceedings of the SIGPLAN ‘90 Conference on Programming Language Design and Implementation, pages 296-310, June 1990. SIGPLAN Notices, Vol 25, No 6.
7. J. D. Choi, M. G. Burke, and P. Carini. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages, pages 232-245, January 1993.
8. K. Cooper and K. Kennedy. Efficient computation of flow insensitive interprocedural summary information. In Proceedings of the SIGPLAN ‘84 Symposium on Compiler Construction, pages 247-258, June 1984. SIGPLAN Notices, Vol 19, No 6.
9. K. D. Cooper and K. Kennedy. Fast interprocedural alias analysis. In Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pages 49-59, January 1989.
10. A. Deutsch. On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications. In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 157-168, January 1990.
11. A. Deutsch. A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations. In Proceedings of the IEEE 1992 International Conference on Computer Languages, pages 2-13, April 1992.
12. C. M. Donawa. The design and implementation of a structured backend for the McCAT C compiler. Master's thesis, School of Computer Science, McGill University, expected July 1994.
13. M. Emami. A practical interprocedural alias analysis for an optimizing/parallelizing C compiler. Master's thesis, School of Computer Science, McGill University, August 1993.
14. A. M. Erosa and L. J. Hendren. Taming control flow: A structured approach to eliminating goto statements. In Proceedings of the IEEE 1994 International Conference on Computer Languages, May 1994.
15. R. Ghiya. Interprocedural analysis in the presence of function pointers. ACAPS Technical Memo 62. School of Computer Science, McGill University, December 1992.
16. R. Ghiya. Practical techniques for heap analysis. ACAPS Technical Note 46, School of Computer Science, McGill University, May 1993.
17. M. W. Hall and K. Kennedy. Efficient call graph analysis. ACM Letters on Programming Languages and Systems, 1(3), pages 227-242, September 1992.
18. L. J. Hendren, M. Emami, R. Ghiya, and C. Verbrugge. A practical context-sensitive interprocedural analysis framework for C compilers. ACAPS Technical Memo 72, School of Computer Science, McGill University, July 1993.
19. L. J. Hendren, G. R. Gao, and V. C. Sreedhar. ALPHA: A family of structured intermediate representations for a parallelizing C compiler. ACAPS Technical Memo 49, School of Computer Science, McGill University, Nov 1992.
20. L. J. Hendren, C. Donawa, M. Emami, G. R. Gao, Justiani, and B. Sridharan. Designing the McCAT compiler based on a family of structured intermediate representations. In Conference Record of Fifth International Workshop on Languages and Compilers for Parallel Computing, August 1992. Volume 757 of Lecture Notes in Computer Science, pages 406-420. Springer Verlag, 1993.
21. L. J. Hendren and A. Nicolau. Parallelizing programs with recursive data structures. IEEE Transactions on Parallel and Distributed Systems, 1(1):35- 47, January 1990.
22. S. Horwitz, P. Pfeiffer, and T. Reps. Dependence analysis for pointer variables. In Proceedings of the SIGPLAN ‘89 Symposium on Programming Language Design and Implementation, pages 28-40, June 1989.
23. S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems, 12(1):26-60, January 1990.
24. N. D. Jones and S. Muchnick. Flow analysis and optimization of LISP-like structures. In Program Flow Analysis, Theory, and Applications, pages 102-131. Prentice-Hall, 1981. Chapter 4.
25. N. D. Jones and S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, pages 66-74, January 1982.
26. Justiani and L. J. Hendren. Supporting array dependence testing for an optimizing/parallelizing C compiler. In Proceedings of 1994 International Conference on Compiler Construction., April 1994. Volume 749 of Lecture Notes in Computer Science. Springer Verlag, 1993.
27. A. Lakhotia. Constructing call multigraphs using dependence graphs. In Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages, pages 273-284, January 1993.
28. W. Landi and B. G. Ryder. A safe approximate algorithm for interprocedural pointer aliasing. In Proceedings of the 1992 SIGPLAN Symposium on Programming Language Design and Implementation, pages 235-248, June 1992.
29. W. Landi, B. G. Ryder, and S. Zhang. Interprocedural modification side effect analysis with pointer aliasing. In Proceedings of the 1993 SIGPLAN Symposium on Programming Language Design and Implementation, pages 56-67, June 1993.
30. W. A. Landi. Interprocedural Aliasing in the Presence of Pointers. PhD thesis, Rutgers University, 1992.
31. T. J. Marlowe, W. A. Landi, B. G. Ryder, J. D. Choi, M. G. Burke, and P. Carini. Pointer-induced aliasing: A clarification. ACM SIGPLAN Notices, 28(9), pages 67-70, September 1993.
32. E. W. Myers. A precise inter-procedural data flow algorithm. In Conference Record of the Eighth Annual ACM Symposium on Principles of Programming Languages. pages 219-230, January 1981.
33. A. Neirynck, P. Panangaden, and A. J. Demers. Effect analysis in higher-order languages. International Journal of Parallel Programming, 18(1):1-37, 1989.
34. H. D. Pande and B. G. Ryder. Static type determination for C++. In Proceedings of the Sixth Usenix C++ Technical Conference, April 1994.
35. B. G. Ryder. Constructing the call graph of a program. IEEE Transactions on Software Engineering, SE-5(3):216-226, May 1979.
36. S. Sagiv, N. Francez, M. Rodeh, and R. Wilhem. A logic-based approach to data flow analysis. In Proceedings of Second International Workshop on Programming Language Implementation and Logic Programming, Volume 456 of Lecture Notes in Computer Science, pages 277-292. Springer Verlag, August 1990.
37. P. Sestoft. Replacing function parameters by global variables. In Conference on Functional Programming Languages and Computer Architecture, pages 39-53, London, September 1989. ACM Press.
38. O. Shivers. Control flow analysis in Scheme. In. In Proceedings of the SIGPLAN ‘88 Symposium on Programming Language Design and Implementation, pages 164-174, June 1988.
39. O. Shivers. Control Flow Analysis of Higher Order Languages. PhD thesis, School of Computer Science, Carnegie Mellon University, 1991.
40. T. C. Spillman. Exposing side-effects in a PL/I optimizing compiler. In Proceedings of the 1971 IFIPS Congress. North Holland Publishing Co., Amsterdam, 1971, pages 56-60.
41. B. Sridharan. An analysis framework for the McCAT compiler. Master's thesis, School of Computer Science, McGill University, September 1992.
42. W. Weihl. Interprocedural data flow analysis in the presence of pointers, procedure variables and label variables. In Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, pages 83-94, January 1980.