A framework for call graph construction algorithms

ACM Transactions on Programming Languages and Systems

Volumn 23, Issue 6, 2001, Pages 685-746

  Grove, David ^b   Chambers, Craig ^a,c  

^a UNIVERSITY OF WASHINGTON   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c University of Washington   (United States)

Author keywords

D.3.2 Programming Languages : Language Classifications applicative (functional) languages; D.3.3 Programming Languages : Language Constructs and Features Classes and objects; D.3.4; Object oriented languages; Procedures, functions, and Subroutines

Indexed keywords

EID: 0011792814     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/506315.506316     Document Type: Article

References (63)

1. AGESEN, O. 1994. Constraint-based type inference and parametric polymorphism. In Proceedings of the First International Static Analysis Symposium. LNCS 864, Springer, New York, NY, 78-100.
2. AGESEN, O. 1995. The cartesian product algorithm: Simple and precise type inference of parametric polymorphism. In Proceedings of the 9th European Conference on Object-Oriented Programming. LNCS 952, Springer, New York, NY, 2-26.
3. AGESEN, O. 1996. Concrete type inference: Delivering object-oriented applications. Ph.D. thesis, SLMI Tech. Rep. 96-52, Stanford Univ., Stanford, CA.
4. AGESEN, O., PALSBERG, J., AND SCHWARTZBACH, M. I. 1993. Type inference of Self: Analysis of objects with dynamic and multiple inheritance. In Proceedings of the 7th European Conference for Object-Oriented Programming. LNCS 707, New York, NY, 247-267.
5. AIKEN, A. 1994. Set constraints: Results, applications, and future directions. In Proceedings of the Second Workshop on the Principles and Practice of Constraint Programming (Orcas Island, WA), 171-179.
6. ALT, M. AND MARTIN, F. 1995. Generation of efficient interprocedural analyzers with PAG. In Proceedings of the Second International Symposium on Static Analysis. LNCS 983, Springer, New York, NY, 33-50.
7. ASHLEY, J. M. 1996. A practical and flexible flow analysis for higher-order languages. In Conference Record of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 184-194.
8. ASHLEY, J. M. 1997. The effectiveness of flow analysis for inlining. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming. ACM SIGPLAN Not. 32, 8 (June), 99-111.
9. BACON, D. F. AND SWEENEY, P. F. 1996. Fast static analysis of C++ virtual function calls. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications. ACM SIGPLAN Not. 31, 10 (Oct.), 324-341.
10. BAIRAGI, D., KUMAR, S., AND AGRAWAL, D. P. 1997. Precise call graph construction for OO programs in the presence of virtual functions. In Proceedings of the 1997 International Conference on Parallel Processing. 412-416.
11. CALLAHAN, D., CARLE, A., HALL, M. W., AND KENNEDY, K. 1990. Constructing the procedure call multigraph. IEEE Trans. Softw. Eng. 16, 4, 483-487.
12. CHAMBERS, C. 1993. The Cecil language: Specification and rationale. Tech. Rep. UW-CSE-93-03-05, Dept. Computer Science and Engineering. Univ. of Washington. Revised, March 1997.
13. CHAMBERS, C., DEAN, J., AND GROVE, D. 1996. Whole-program optimization of object-oriented languages. Tech. Rep. UW-CSE-96-06-02, Dept. of Computer Science and Engineering. Univ. of Washington. June.
14. CHAMBERS, C. AND UNGAR, D. 1989. Customization: Optimizing compiler technology for SELF, a dynamically-typed object-oriented programming language. In Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation. ACM SIGPLAN Not. 24, 7 (July), 146-160.
15. CHAMBERS, C. AND UNGAR, D. 1990. Iterative type analysis and extended message splitting: Optimizing dynamically-typed object-oriented programs. In Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation. ACM SIGPLAN Not. 25, 6 (June), 150-164.
16. COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the Conference Record of the Fourth ACM Symposium on Principles of Programming Languages. ACM, New York, NY, 238-252.
17. DEAN, J. 1996. Whole program optimization of object-oriented languages. Ph.D. thesis, Tech. Rep. UW-CSE-96-11-05, Univ. of Washington.
18. DEAN, J., DEFOUW, G., GROVE, D., LITVINOV, V., AND CHAMBERS, C. 1996. Vortex: An optimizing compiler for object-oriented languages. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications. ACM SIGPLAN Not. 31, 10 (Oct.), 83-100.
19. DEAN, J., GROVE, D., AND CHAMBERS, C. 1995. Optimization of object-oriented programs using static class hierarchy analysis. In Proceedings of the 9th European Conference for Object-Oriented Programming. LNCS 952, Springer, New York, NY.
20. DEFOUW, G., GROVE, D., AND CHAMBERS, C. 1998. Fast interprocedural class analysis. In Proceedings of the Conference Record of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, NY, 222-236.
21. DEUTSCH, L. P. AND SCHIFFMAN, A. M. 1984. Efficient implementation of the Smalltalk-80 system. In Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages. ACM, New York, NY, 297-302.
22. DIWAN, A., Moss, E., AND MCKINLEY, K. 1996. Simple and effective analysis of statically-typed object-oriented programs. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications. ACM SIGPLAN Not. 31, 10 (Oct.), 292-305.
23. EMAMI, M., GHIYA, R., AND HENDREN, L. J. 1994. 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. ACM SIGPLAN Not. 29, 6 (June) 242-256.
24. FERNANDEZ, M. F. 1995. Simple and effective link-time optimization of Modula-3 programs. In Proceedings of the ACM SIGPLAN '95 Conference on Programming Language Design and Implementation. ACM SIGPLAN Not. 30, 6 (June), 103-115.
25. GOSLING, J., JOY, B., AND STEELE, G. 1996. The Java Language Specification. Addison-Wesley, Reading, MA.
26. GROVE, D. 1995. The impact of interprocedural class analysis on optimization. In Proceedings CASCON '95 (Toronto, Canada), 195-203.
27. GROVE, D. 1998. Effective interprocedural optimization of object-oriented languages. Ph.D. thesis, Univ. of Washington.
28. GROVE, D., DEAN, J., GARRETT, C., AND CHAMBERS, C. 1995. Profile-guided receiver class prediction. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications. ACM SIGPLAN Not. 30, 10 (Oct.), 108-123.
29. GROVE, D., DEFOUW, G., DEAN, J., AND CHAMBERS, C. 1997. Call graph construction in object oriented languages. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications. ACM SIGPLAN Not. 32, 10 (Oct.), 108-124.
30. HALL, M. W. AND KENNEDY, K. 1992. Efficient call graph analysis. ACM Lett. Program. Lang. Syst. 1, 3 (Sept.), 227-242.
31. HEINTZE, N. AND MCALLESTER, D. 1997. Linear-time subtransitive control flow analysis. In Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation. ACM SIGPLAN Not. 32, 6 (June), 261-272.
32. HENGLEIN, F. 1991. Efficient type inference for higher-order binding-time analysis. In Functional Programming and Computer Architecture.
33. HÖLZLE, U. AND AGESEN, O. 1996. Dynamic vs. static optimization techniques for object-oriented languages. Theor. Pract. Object Syst. 1, 3.
34. HÖLZLE, U. AND UNGAR, D. 1994. Optimizing dynamically-dispatched calls with run-time type feedback. In Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation. ACM SIGPLAN Not. 29, 6 (June), 326-336.
35. JAGANNATHAN, S. AND WEEKS, S. 1995. A unified treatment of flow analysis in higher-order languages. In Proceedings of the Conference Record of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, NY, 393-407.
36. JOHNSON, R. E., GRAVER, J. O., AND ZURAWSKI, L. W. 1988. TS: An optimizing compiler for Smalltalk. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications. ACM SIGPLAN Not. 23, 10 (Oct.).
37. KAM, J. B. AND ULLMAN, J. D. 1976. Global data flow analysis and iterative algorithms. J. ACM 23, 1 (Jan.), 158-171.
38. KILDALL, G. A. 1973. A unified approach to global program optimization. In Proceedings of the Conference Record of the First ACM Symposium on Principles of Programming Languages. ACM, New York, NY, 194-206.
39. KRANZ, D. 1988. Orbit: An optimizing compiler for scheme. Ph.D. thesis, Res. Rep. 632, Yale Univ., Dept. of Computer Science.
40. LAKHOTIA, A. 1993. Constructing call multigraphs using dependence graphs. In Proceedings of the Conference Record of the Twentieth ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, NY, 273-284.
41. LANDI, W. AND RYDER, B. G. 1991. Pointer-induced aliasing: A problem classification. In Proceedings of the Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages. ACM, New York, NY, 93-103.
42. NIELSON, F. AND NIELSON, H. R. 1997. Infinitary control flow analysis: A collecting semantics for closure analysis. In Proceedings of the Conference Record of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, NY, 332-345.
43. OXHØJ, N., PALSBERG, J., AND SCHWARTZBACH, M. I. 1992. Making type inference practical. In Proceedings ECOOP '92, O. L. Madsen, Ed., LNCS 615, Springer, New York, NY, 329-349.
44. PALSBERG, J. AND PAVLOPOULOU, C. 1998. From polyvariant flow information to intersection and union types. In Proceedings of the Conference Record of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, NY, 197-208.
45. PALSBERG, J. AND SCHWARTZBACH, M. I. 1991. Object-oriented type inference. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications. ACM SIGPLAN Not. 26, 10 (Oct.), 146-161.
46. PANDE, H. D. AND RYDER, B. G. 1994. Static type determination for C++. In Proceedings of Sixth USENIX C++ Technical Conference.
47. PHILLIPS, G. AND SHEPARD, T. 1994. Static typing without explicit types. Unpublished report, Dept. of Electrical and Computer Engineering, Royal Military College of Canada, Kingston, Ont., Canada.
48. PLEVYAK, J. 1996. Optimization of object-oriented and concurrent programs. Ph.D. thesis, Univ. of Illinois at Urbana-Champaign.
49. PLEVYAK, J. AND CHIEN, A. A. 1994. Precise concrete type inference for object-oriented languages. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications. ACM SIGPLAN Not. 29, 10 (Oct.), 324-340.
50. RYDER, B. 1979. Constructing the call graph of a program. IEEE Trans. Softw. Eng. 5, 3, 216-225.
51. SHAPIRO, M. AND HORWITZ, S. 1997. Fast and accurate flow-insensitive points-to analysis. In Proceedings of the Conference Record of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, NY, 1-14.
52. SHARIR, M. AND PNUELI, A. 1981. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications, S. S. Muchnick and N. D. Jones, Eds. Prentice-Hall, Englewood Cliffs, NJ, Ch. 7, 189-233.
53. SHIVERS, O. 1988. Control-flow analysis in Scheme. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation. ACM SIGPLAN Not. 23, 1 (June), 164-174.
54. SHIVERS, O. 1991. Control-flow analysis of higher-order languages. Ph.D. thesis, Tech. Rep. CMU-CS-91-145, Carnegie Mellon Univ., Pittsburgh, PA.
55. STEENSGAARD, B. 1994. A polyvariant closure analysis with dynamic abstraction. Unpublished manuscript.
56. STEENSGAARD, B. 1996. Points-to analysis in almost linear time. In Proceedings of the Conference Record of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, NY, 32-41.
57. STEFANESCU, D. AND ZHOU, Y. 1994. An equational framework for the flow analysis of higher-order functional programs. In Proceedings of the ACM Symposium on Lisp and Functional Programming. ACM, New York, NY, 190-198.
58. SUNDARESAN, V., HENDREN, L., RAZAFIMAHEFA, C., VALLÉE-RAI, R., LAM, P., GAGNON, E., AND GODIN, C. 2000. Practical virtual method call resolution for Java. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications. ACM SIGPLAN Not. 35, 10 (Oct.), 264-280.
59. TARJAN, R. E. 1975. Efficiency of a good but not linear set union algorithm. J. ACM 22, 2, 215-225.
60. TIP, F. AND PALSBERG, J. 2000. Scalable propagation-based call graph construction algorithms. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications. ACM SIGPLAN Not. 35, 10 (Oct.), 281-293.
61. VITEK, J., HORSPOOL, N., AND UHL, J. 1992. Compile time analysis of object-oriented programs. In Proceedings of the Fourth International Conference on Compiler Construction LNCS 641 Springer, New York, NY, 237-250.
62. WILSON, R. P. AND LAM, M. S. 1995. Efficient context-sensitive pointer analysis for C programs In Proceedings of the ACM SIGPLAN '95 Conference on Programming Language Design and Implementation. ACM SIGPLAN Not. 30, 6 (June), 1-12.
63. WRIGHT, A. K. AND JAGANNATHAN, S. 1998. Polymorphic splitting: an effective polyvariant flow analysis. ACM Trans. Program. Lang. Syst. 20, 1 (Jan.), 166-207.