Fast online pointer analysis

ACM Transactions on Programming Languages and Systems

Volumn 29, Issue 2, 2007, Pages

  Hirzel, Martin ^a,c   Von Dincklage, Daniel ^b   Diwan, Amer ^b   Hind, Michael ^a,c  

^a IBM RESEARCH   (United States)

^b UNIVERSITY OF COLORADO   (United States)

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

Author keywords

Class loading; Native interface; Pointer analysis; Reflection

Indexed keywords

CLASS LOADING; NATIVE INTERFACE; POINTER ANALYSIS; VIRTUAL MACHINES;

DYNAMIC LOADS; INTERFACES (COMPUTER); JAVA PROGRAMMING LANGUAGE; OPTIMIZATION; PROBLEM SOLVING;

ONLINE SYSTEMS;

EID: 34247276506     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1216374.1216379     Document Type: Article

References (77)

1. AGRAWAL, G., LI, J., AND SU, Q. 2002. Evaluating a demand driven technique for call graph construction. In Proceedings of the 11th International Conference on Compiler Construction (CC). Lecture Notes on Computer Science, vol. 2304. Springer Verlag, 29-45.
2. ALPERN, B., ATTANASIO, C. R., BARTON, J. J., BURKE, M. G., CHENO, P., CHOI, J.-D., COCCHI, A., FINK, S. J., GROVE, D., HIND, M., HUMMEL, S. F., LIEBER, D., LITVINOV, V., MERGEN, M. F., NGO, T., RUSSELL, J. R., SARKAR, V., SERRANO, M. J., SHEPHERD, J. C., SMITH, S. E., SREEDHAR, V. C., SRINIVASAN, H., AND WHALEY, J. 2000. The Jalapeno virtual machine. IBM Syst. J. 39, 1 (Feb.), 211-238.
3. ANDERSEN, L. O. 1994. Program analysis and specialization for the C programming language. Ph.D. thesis, DIKU, University of Copenhagen. DIKU report 94/19. ftp://ftp.diku.dk/pub/diku/semantics/papers/D-203.dvi.Z.
4. ARNOLD, M., FINK, S., GROVE, D., HIND, M., AND SWEENEY, P. F. 2000. Adaptive optimization in the Jalapeno JVM. ACM SIGPLAN Not. 35, 10 (Oct.), 47-65. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA).
5. ARNOLD, M. AND RYDER, B. G. 2002. Thin guards: A simple and effective technique for reducing the penalty of dynamic class loading. In Proceedings of the 16th European Conference on Object-Oriented Programming (ECOOP). Lecture Notes in Computer Science, vol. 2374. Springer Verlag.
6. BACON, D. F. AND SWEENEY, P. F. 1996. Fast static analysis of C++ virtual function calls. ACM SIGPLAN Not. 31, 10 (Oct.), 324-341. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA).
7. BERNDL, M., LHOTÁK, O., QIAN, F., HENDHEN, L., AND UMANEE, N. 2003. Points-to analysis using BDDs. ACM SIGPLAN Not. 38, 5 (May), 103-114. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI).
8. BOGDA, J. AND SINGH, A. 2001. Can a shape analysis work at run-time? In. Proceedings of the Java Virtual Machine Research and Technology Symposium (JVM). 13-26.
9. BURKE, M., CARINI, P., CHOI, J.-D., AND HIND, M. 1994. Flow-Insensitive Interprocedural alias analysis in the presence of pointers. In Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing (LCPC), Extended version published as Res. Rep. RC 19546, IBM T. J. Watson Research Center, September.
10. BURKE, M. AND TOHCZON, L. 1998. Interprocedural optimization: Eliminating unnecessary recompilation. ACM Trans. Program. Lang. Syst. 15, 3 (Jul.), 367-399.
11. CHATTERJEE, R., RYDER, B. G., AND LANDI, W. A. 1999. Relevant context inference. In Proceedings of the 26th Symposium on Principles of Programming Languages (POPL). 133-146.
12. CHENG, B.-C. AND HWU, W.-M. W. 2000. Modular interprocedural pointer analysis using access paths: Design, implementation, and evaluation. ACM SIGPLAN Not. 35, 5 (May), 57-69. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI).
13. CHOI, J.-D., GROVE, D., HIND, M., AND SAHKAR, V. 1999. Efficient and precise modeling of exceptions for the analysis of Java programs. In Proceedings of the Workshop on Program Analysis for Software Tools and Engineering (PASTE). 21-31.
14. CHOI, J.-D., GUPTA, M., SEHRANO, M., SREEDHAR, V. C., AND MIDKIFF, S. 1999. Escape analysis for Java. ACM SIGPLAN Not. 34, 10 (Oct.), 1-19. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA).
15. CHRISTENSEN, A. S., MøLLER, A., AND SCHWARTZBACH, M. I. 2003. Precise analysis of string expressions. In. Proceedings of the 10th International Static Analysis Symposium (SAS). Lecture Notes in Computer Science, vol. 2694. Springer Verlag. 1-18.
16. CIERNIAK, M., LUEH, G.-Y, AND STICHNOTH, J. M. 2000. Practicing JUDO: Java under dynamic optimizations. ACM SIGPLAN Not. 35, 5 (May), 13-26. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI).
17. COOPER, K. D., KENNEDY, K., AND TORCZON, L. 1986. Interprocedural optimization: Eliminating unnecessary recompilation. ACM SIGPLAN Not. 21, 7 (Jul.), 58-67. In Proceedings of the Symposium on Compiler Construction (SCC).
18. DAS, M. 2000. Unification-Based pointer analysis with directional assignments. ACM SIGPLAN Not. 36, 5 (May), 35-46. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI).
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 on Object-Oriented Programming (ECOOP). Lecture Notes in Computer Science, vol. 952. Springer Verlag. 77-101.
20. DETLEFS, D. AND AGESEN, O. 1999. Inlining of virtual methods. In Proceedings of the 13th European Conference on Object-Oriented Programming (ECOOP). Lecture Notes in Computer Science, vol. 1628. Springer Verlag. 258-278.
21. DIWAN, A., MCKINLEY, K. S., AND MOSS, J. E. B. 2001. Using types to analyze and optimize object-oriented programs. ACM Trans. Program. Lang. Syst. 23, 1 (Jan.), 30-72.
22. DUESTERWALD, E., GUPTA, R., AND SOFFA, M. L. 1997. A practical framework for demand-driven interprocedural data flow analysis. ACM Trans. Program. Lang. Syst. 19, 6 (Nov.), 992-1030.
23. EMAMI, M., GHIYA, R., AND HENDREN, L. J. 1994. Context-Sensitive interprocedural points-to analysis in the presence of function pointers. ACM SIGPLAN Not. 29, 6 ( Jun.), 242-256. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI).
24. FÄHNDRICH, M., FOSTER, J. S., SU, Z., AND AIKEN, A. 1998. Partial online cycle elimination in inclusion constraint graphs. ACM SIGPLAN Not. 33, 5 (May), 85-96. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI).
25. FERNÁNDEZ, M. F. 1995. Simple and effective link-time optimization of Modula-3 programs. ACM SIGPLAN Not. 30, 6 (Jun.), 103-115. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI).
26. FINK, S. J. AND QIAN, F. 2003. Design, implementation and evaluation of adaptive recompilation with on-stack replacement. In Proceedings of the International Symposium on Code Generation and Optimization (CGO). 241-252.
27. FOSTER, J. S., FÄHNDRICH, M., AND AIKEN, A. 1997. Flow-Insensitive points-to analysis with term and set constraints. Tech. Rep. UCB/CSD-97-964, University of California at Berkeley. August.
28. GHIYA, R. 1992. Interprocedural aliasing in the presence of function pointers. ACAPS Tech. Memo 62, McGill University. December.
29. GROVE, D. 1998. Effective interprocedural optimization of object-oriented languages. Ph.D. thesis, University of Washington.
30. GRUNWALD, D. AND SRINIVASAN, H. 1993. Data flow equations for explicitly parallel programs. In Proceedings of the 4th ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming.
31. GUYER, S. AND LIN, C. 2003. Client-Driven pointer analysis. In Proceedings of the 10th International Static Analysis Symposium (SAS). Lecture Notes in Computer Science, vol. 2694. Springer Verlag. 214-236.
32. HALL, M. W., MELLOR-CRUMMEY, J. M., CARLE, A., AND RODRIGUEZ, R. G. 1993. Fiat: A framework for interprocedural analysis and transformations. In Proceedings of the 6th Workshop on Languages and Compilers for Parallel Computing (LCPC). Lecture Notes in Computer Science, vol. 768. Springer Verlag. 522-545.
33. HARRIS, T. 1999. Early storage reclamation in a tracing garbage collector. ACM SIGPLAN Not. 34, 4 (Apr.), 46-53. In Proceedings of the International Symposium on Memory Management (ISMM).
34. HEINTZE, N. 1999. Analysis of large code bases: The compile-link-analyze model. Unpublished Rep. http://cm.bell-labs.com/cm/cs/who/ nch/cla.ps.
35. HEINTZE, N. AND TARDIEU, O. 2001a. Demand-Driven pointer analysis. ACM SIGPLAN Not. 36, 5 (May), 24-34. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI).
36. HEINTZE, N. AND TARDIEU, O. 2001b. Ultra-Fast aliasing analysis using CLA: A million lines of C code in a second. ACM SIGPLAN Not. 36, 5 (May), 254-263. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI).
37. HENDREN, L. 1990. Parallelizing programs with recursive data structures. Ph.D. thesis, Cornell University.
38. HIND, M. 2001. Pointer analysis: Haven't we solved this problem yet? In Workshop on Program Analysis for Software Tools and Engineering (PASTE). 54-61. Invited talk.
39. HIND, M. AND PIOLI, A. 2000. Which pointer analysis should I use? In Proceedings of the International Symposium on Software Testing and Analysis (ISSTA). 113-123.
40. HIRZEL, M., DIWAN, A., AND HERTZ, M. 2003. Connectivity-Based garbage collection. ACM SIGPLAN Not. 38, 11 (Nov.), 359-373. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA).
41. HIRZEL, M., DIWAN, A., AND HIND, M. 2004. Pointer analysis in the pressence of dynamic class loading. In Proceedings of the 18th European Conference on Object-Oriented Programming (ECOOP). Lecture Notes in Computer Science, vol. 3086. Springer Verlag. 96-122.
42. HIRZEL, M., HENKEL, J., DIWAN, A., AND HIND, M. 2003. Understanding the connectivity of heap objects. ACM SIGPLAN Not. 38, 2s (Feb.), 143-156. In. Proceedings of the International Symposium on Memory Management (ISMM).
43. HÖLZLE, U., CHAMBERS, C., AND UNGAR, D. 1992. Debugging optimized code with dynamic deoptimization. ACM SIGPLAN Not. 27, 7 (Jul.), 32-43. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI).
44. HÖLZLE, U AND UNGAR, D. 1994. Optimizing dynamically-dispatched calls with run-time type feedback. ACM SIGPLAN Not. 29, 6 (Jun.), 326-336. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI).
45. HUNT, G., LARUS, J., ABADI, M., AIKEN, M., BARHAM, P., FÄHNDRICH, M., HAWBLITZEL, C., HODSON, O., LEVI, S., MUPRHY, N., STEENSGAARD, B., TARDITI, D., WOBBER, T., AND ZILL, B. 2005. An overview of the Singularity project. Tech. Rep. MSR-TR-2005-135, Microsoft Research.
46. KING, A. C. 2003. Removing synchronization (extended version). Tech. rep. 11-03, Computing Laboratory, University of Kent.
47. KOTZMANN, T. AND MÖSSENBÖCK, H. 2005. Escape analysis in the context of dynamic compilation and deoptimization. In Virtual Execution Environments (VEE).
48. LARUS, J. R. AND CHANDRA, S. 1993. Using tracing and dynamic slicing to tune compilers. Tech. Rep. 1174. August.
49. LATTNER, C. AND ADVE, V. 2003. Data structure analysis: An efficient context-sensitive heap analysis. Tech. Rep. UIUCDCS-R-2003-2340, Computer Science Department, University of Illinois at Urbana-Champaign. April.
50. LE, A., LHOTÁK, O., AND HENDREN, L. 2005. Using inter-procedural side-effect information in JIT optimizations. In Proceedings of the 14th International Conference on Compiler Construction (CC). Lecture Notes in Computer Science, vol. 3443. Springer Verlag. 287-304.
51. LHOTÁK, O. AND HENDREN, L. 2003. Scaling Java points-to analysis using SPARK. In Proceedings of the 12th International Conference on Compiler Construction (CC). Lecture Notes in Computer Science, vol. 2622. Springer Verlag. 153-169.
52. LIANG, D. AND HARROLD, M. J. 1999. Efficient points-to analysis for whole-program analysis. In Proceedings of the 7th European Software Engineering Conference, and International Symposium on Foundations of Software Engineering (ESEC/FSE), O. Nierstraz and M. Lemoine, eds. Lecture Notes in Computer Science, vol. 1687. Springer Verlag. 199-215.
53. LIANG, D., PENNINGS, M., AND HARROLD, M. J. 2001. Extending and evaluating flow-insensitive and context-insensitive points-to analyses for Java. In Proceedings of the Workshop on Program Analysis for Software Tools and Engineering (PASTE). 73-79.
54. LIANG, D., PENNINGS, M., AND HARROLD, M. J. 2002. Evaluating the precision of static reference analysis using profiling. In Proceedings of the International Symposium on Software Testing and Analysis (ISSTA). 22-32.
55. LINDHOLM, T. AND YELLIN, F. 1999. The Java Virtual Machine Specification, 2nd ed. Addison-Wesley.
56. LIVSHITS, B., WHALEY, J., AND LAM, M. S. 2005. Reflection analysis for Java. In Proceedings of the Asian Symposium on Programming Languages and Systems (APLAS).
57. MOCK, M., DAS, M., CHAMBERS, C., AND EGGERS, S. J. 2001. Dynamic points-to sets: A comparison with static analyses and potential applications in program understanding and optimization. In Proceedings of the Workshop on Program Analysis for Software Tools and Engineering (PASTE). 66-72.
58. PALECZNY, M., VICK, C., AND CLICK, C. 2001. The Java Hotspot server compiler. In Proceedings of the Java Virtual Machine Research and Technology Symposium (JVM). 1-12.
59. PECHTCHANSKI, I. AND SARKAR, V. 2001. Dynamic optimistic interprocedural analysis: A framework and an application. ACM SIGPLAN Not. 36, 11 (Nov.), 195-210. In. Proceedings of the Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA).
60. PLEVYAK, J. AND CHIEN, A. A. 1994. Precise concrete type inference for object-oriented languages. ACM SIGPLAN Not. 29, 10 (Oct.), 324-324. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA).
61. QIAN, F. AND HENDREN, L. 2004. Towards dynamic interprocedural analysis in JVMs. In Proceedings of the 3rd Virtual Machine Research and Technology Symposium (VM). 139-150.
62. QIAN, F. AND HENDREN, L. 2005. A study of type analysis for speculative method inlining in a JIT environment. In. Proceedings of the 14th International Conference on Compiler Construction (CC). Lecture Notes in Computer Science, vol. 3443. Springer Verlag. 255-270.
63. ROUNTEV, A. AND CHANDRA, S. 2000. Off-Line variable substitution for scaling points-to analysis. ACM SIGPLAN NOT. 35, 5 (May), 47-56. In PROCEEDINGS OF THE CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI).
64. ROUNTEV, A., MILANOVA, A., AND RYDER, B. G. 2001. Points-To analysis for Java using annotated constraints. ACM SIGPLAN Not. 36, 11 (Nov.), 43-55. In. Proceedings of the Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA).
65. RUF, E. 2000. Effective synchronization removal for Java. ACM SIGPLAN Not. 35, 5 (May), 208-218. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI).
66. RYDER, B. G. 2003. Dimensions of precision in reference analysis for object-oriented programming languages. In Proceedings of the 12th International Conference on Compiler Construction (CC), G. Hedin, ed. Lecture Notes in Computer Science, vol. 2622. Springer Verlag. 126-137.
67. SAGIV, M., REPS, T., AND WILHELM, R. 1999. Parametric shape analysis via 3-valued logic. In Proceedings of the 26th Symposium on Principles of Programming Languages (POPL). 105-118.
68. SHAPIRO, M. AND HORWITZ, S. 1997. The effects of the precision of pointer analysis. In Proceedings of the 4th International Symposium on Static Analysis (SAS). Lecture Notes in Computer Science, vol. 1302. Springer Verlag. 16-34.
69. SREEDHAR, V. C., BURKE, M., AND CHOI, J.-D. 2000. A framework for interprocedural optimization in the presence of dynamic class loading. ACM SIGPIAN Not. 35, 5 (May), 196-207. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI).
70. SHIDHAHAN, M. AND BODÍK, R. 2006. Refinement-Based context-sensitive points-to analysis for Java. In Proceedings of the Programming Language Design and Implementation (PLDI).
71. STEENSGAARD, B. 1996. Points-To analysis in almost linear time. In Proceedings of the 23rd Symposium on Principles of Programming Languages (POPL). 32-41.
72. SUGANUMA, T., YASUE, T., KAWAHITO, M., KOMATSU, H., AND NAKATANI, T. 2001. A dynamic optimization framework for a Java just-in-time compiler. ACM SIGPLAN Not. 36, 11 (Nov.), 180-195. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA).
73. 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. ACM SIGPLAN Not. 35, 10 (Oct.), 264-280. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA).
74. TIP, F. AND PALSBERG, J. 2000. Scalable propagation-based call graph construction algorithms. ACM SIGPLAN Not. 35, 10 (Oct.), 281-293. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA).
75. VALLÉE-RAI, R., GAGNON, E., HENDREN, L., LAM, P., POMINVILLE, P., AND SUNDARESAN, V. 2000. Optimizing Java bytecode using the Soot framework: Is it feasible? In Proceedings of the 9th International Conference on Compiler Construction (CC), Lecture Notes in Computer Science, vol. 1781. Springer Verlag. 18-34.
76. VIVIEN, F. AND RINAHD, M. 2001. Incrementalized pointer and escape analysis. ACM SIGPLAN Not. 36, 5 (May), 35-46. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI).
77. WHALEY, J. AND LAM, M. 2002. An efficient inclusion-based points-to analysis for strictly-typed languages. In Proceedings of the 9th International Symposium on Static Analysis (SAS). Lecture Notes in Computer Science, vol. 2477. Springer Verlag. 180-195.