Ointer Analysis in the presence of dynamic class loading

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

Volumn 3086, Issue , 2004, Pages 96-122

  Hirzel, Martin ^a,b   Diwan, Amer ^a,b   Hind, Michael ^a,b  

^a UNIVERSITY OF COLORADO   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; JAVA PROGRAMMING LANGUAGE;

DYNAMIC CLASS LOADING; JAVA LANGUAGE; NON-TRIVIAL; POINTER ANALYSIS;

OBJECT ORIENTED PROGRAMMING;

EID: 35048831472     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24851-4_5     Document Type: Article

References (59)

1. . G. Agrawal, J. Li, and Q. Su. Evaluating a demand driven technique for call graph construction. In Internat. Conference on Compiler Construction (CG), 2002.
2. B. Alpern, G. R. Attanasio, J. J. Barton, M. G. Burke, P. Cheng, J.-D. Choi, A. Cocchi, S. J. Fink, D. Grove, M. Hind, S. F. Hummel, D. Lieber, V. Litvinov, M. F. Mergen, T. Ngo, J. R. Russell, V. Sarkar, M. J. Serrano, J. G. Shepherd, S. E. Smith, V. G. Sreedhar, H. Srinivasan, and J. Whaley. The Jalapeno virtual machine. IBM Systems Journal, 39(1), 2000.
3. . L. O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, University of Copenhagen, 1994. DIKU report 94/19.
4. M. Arnold, S. Fink, D. Grove, M. Hind, and P. F. Sweeney. Adaptive optimization in the Jalapeno JVM. In Obj.-Oriented Prog., Systems, Lang., and Applic. (OOPSLA), 2000.
5. M. Arnold and B. G. Ryder. Thin guards: A simple and effective technique for reducing the penalty of dynamic class loading. In European Conference for ObjectOriented Prog. (ECOOP), 2002.
6. D. F. Bacon and P. F. Sweeney. Fast static analysis of C++ virtual function calls. In Obj.-Oriented Prog., Systems, Lang., and Applic. (OOPSLA), 1996.
7. J. Bogda and A. Singh. Can a shape analysis work at run-time? In Java Virtual Machine Research and Technology Symp. (JVM), 2001.
8. M. Burke and L. Torczon. Interprocedural optimization: Eliminating unnecessary recompilation. Thins, on Prog. Lang, and Systems (TOPLAS), 1993.
9. R. Chatterjee, B. G. Ryder, and W. A. Landi. Relevant context inference. In Principles of Prog. Lang. (POPL), 1999.
10. B.-C. Cheng and W.-m. W. Hwu. Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation. In Prog. Lang. Design and Impl. (PLDI), 2000.
11. J.-D. Choi, M. Gupta, M. Serrano, V. C. Sreedhar, and S. Midkiff. Escape analysis for Java. In Obj.-Oriented Prog., Systems, Lang., and Applic. (OOPSLA), 1999.
12. A. S. Christensen, A. Møller, and M. I. Schwartzbach. Precise analysis of string expressions. In Static Analysis Symposium (SAS), 2003.
13. M. Cierniak, G.-Y.Lueh, and J. M. Stichnoth. Practicing JUDO: Java under dynamic optimizations. In Prog. Lang. Design and Impl. (PLDI), 2000.
14. K. D. Cooper, K. Kennedy, and L. Torczon. Interprocedural optimization: Eliminating unnecessary recompilation. Trans, on Prog. Lang, and Systems (TOPLAS), 1986.
15. M. Das. Unification-based pointer analysis with directional assignments. In Prog. Lang. Design and Impl. (PLDI), 2000.
16. J. Dean, D. Grove, and C. Chambers. Optimization of object-oriented programs using static class hierarchy analysis. In European Conference for Object-Oriented Prog. (ECOOP), 1995.
17. D. Detlefs and O. Agesen. Inlining of virtual methods. In European Conference for Object-Oriented Prog. (ECOOP), 1999.
18. A. Diwan, K. S. McKinley, and J. E. B. Moss. Using types to analyze and optimize object-oriented programs. Trans, on Prog. Lang, and Systems (TOPLAS), 2001.
19. M. Fähndrich, J. S. Foster, Z. Su, and A. Aiken. Partial online cycle elimination in inclusion constraint graphs. In Prog. Lang. Design and Impl. (PLDI), 1998.
20. M. F. Fernandez. Simple and effective link-time optimization of Modula-3 programs. In Prog. Lang. Design and Impl. (PLDI), 1995.
21. S. J. Fink and F. Qian. Design, implementation, and evaluation of adaptive recompilation with on-stack replacement. In Code Gen. and Optimization (CGO), 2003.
22. J. S. Foster, M. Fähndrich, and A. Aiken. Flow-insensitive points-to analysis with term and set constraints. Technical report, University of California at Berkeley, 1997.
23. D. P. Grove. Effective Interprocedural Optimization of Object-Oriented Languages. PhD thesis, University of Washington, 1998.
24. M. W. Hall, J. M. Mellor-Crummey, A. Carle, and R. G. Rodriguez. Fiat: A framework for interprocedural analysis and transformations. In Workshop on Languages and Compilers for Parallel Computing (LCPC), 1993.
25. T. Harris. Early storage reclamation in a tracing garbage collector. ACM SIGPLAN Notices, 1999.
26. N. Heintze. Analysis of large code bases: The compile-link-analyze model, http://cm.bell-labs.com/cm/cs/who/nch/cla.ps, 1999.
27. N. Heintze and O. Tardieu. Demand-driven pointer analysis. In Prog. Lang. Design and Impl. (PLDI), 2001.
28. N. Heintze and O. Tardieu. Ultra-fast aliasing analysis using CLA: A million lines of C code in a second. In Prog. Lang. Design and Impl. (PLDI), 2001.
29. L. Hendren. Parallelizing Programs with Recursive Data Structures. PhD thesis, Cornell University, 1990.
30. M. Hind. Pointer analysis: Haven't we solved this problem yet? In Workshop on Program Analysis for Software Tools and Engineering (PASTE), 2001.
31. M. Hind and A. Pioli. Which pointer analysis should I use? In Internat. Syrap. on Software Testing and Analysis (ISSTA), 2000.
32. M. Hirzel, A. Diwan, and M. Hertz. Connectivity-based garbage collection. In Obj.-Oriented Prog., Systems, Lang., and Applic. (OOPSLA), 2003.
33. M. Hirzel, J. Henkel, A. Diwan, and M. Hind. Understanding the connectivity of heap objects. In Internat. Symp. on Memory Management (ISMM), 2002.
34. U. Hölzle, C. Chambers, and D. Ungar. Debugging optimized code with dynamic deoptimization. In Prog. Lang. Design and Impl. (PLDI), 1992.
35. U. Hölzle and D. Ungar. Optimizing dynamically-dispatched calls with run-time type feedback. In Prog. Lang. Design and Impl. (PLDI), 1994.
36. A. C. King. Removing GC synchronization (extended version). http : //www. acm. org/src/subpages/AndyKing/overvieu. html, 2003. Winner (Graduate Division) ACM Student Research Competition.
37. J. R. Larus and S. Chandra. Using tracing and dynamic slicing to tune compilers. University of Wisconsin Technical Report 1174, Aug. 1993.
38. C. Lattner and V. Adve. Data Structure Analysis: An Efficient Context-Sensitive Heap Analysis. Tech. Report UIUCDCS-R-2003-2340, Computer Science Dept., Univ. of Illinois at Urbana-Champaign, Apr 2003.
39. O. Lhoták and L. Hendren. Scaling Java points-to analysis using SPARK. In Internat. Conference on Compiler Construction (CC), 2003.
40. D. Liang, M. Pennings, and M. J. Harrold. Extending and evaluating flowinsenstitive and context-insensitive points-to analyses for Java. In Workshop on Program Analysis for Software Tools and Engineering (PASTE), 2001.
41. D. Liang, M. Pennings, and M. J. Harrold. Evaluating the precision of static reference analysis using profiling. In Internat. Symp. on Software Testing and Analysis (ISSTA), 2002.
42. T. Lindholm and F. Yellin. The Java virtual machine specification. AddisonWesley, second edition, 1999.
43. M. Paleczny, G. Vick, and C. Click. The Java HotSpot server compiler. In Java Virtual Machine Research and Technology Symp. (JVM), 2001.
44. I. Pechtchanski and V. Sarkar. Dynamic optimistic interprocedural analysis: a framework and an application. In Obj.-Oriented Prog., Systems, Lang., and Applic. (OOPSLA), 2001.
45. F. Qian and L. Hendren. Towards dynamic interprocedural analysis in JVMs. In Java Virtual Machine Research and Technology Symp. (JVM), 2004.
46. A. Rountev and S. Chandra. Off-line variable substitution for scaling points-to analysis. In Prog. Lang. Design and Impl. (PLDI), 2000.
47. A. Rountev, A. Milanova, and B. G. Ryder. Points-to analysis for Java using annotated constraints. In Obj.-Oriented Prog., Systems, Lang., and Applic. (OOPSLA), 2001.
48. E. Ruf. Effective synchronization removal for Java. In Prog. Lang. Design and Impl. (PLDI), 2000.
49. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. In Principles of Prog. Lang. (POPL), 1999.
50. M. Shapiro and S. Horwitz. The effects of the precision of pointer analysis. In Static Analysis Symp. (SAS), 1997.
51. V. C. Sreedhar, M. Burke, and J.-D. Choi. A framework for interprocedural analysis and optimization in the presence of dynamic class loading. In Prog. Lang. Design and Impl. (PLDI), 2000.
52. B. Steensgaard. Points-to analysis in almost linear time. In Principles of Prog. Lang. (POPL), 1996.
53. T. Suganuma, T. Yasue, M. Kawahito, H. Komatsu, and T. Nakatani. A dynamic optimization framework for a Java just-in-time compiler. In Obj.-Oriented Prog., Systems, Lang., and Applic. (OOPSLA), 2001.
54. V. Sundaresan, L. J. Hendren, C. Razafimahefa, V.-R. Raja, P. Lam, E. Gagnon, and C. Godin. Practical virtual method call resolution for Java. In Obj.-Oriented Prog., Systems, Lang., and Applic. (OOPSLA), 2000.
55. The Apache Tomcat Project. Apache Tomcat, 56. The Eclipse Project. Eclipse, http://www.eclipse.org.
56. F. Tip and J. Palsberg. Scalable propagation-based call graph construction algorithms. In Obj.-Oriented Prog., Systems, Lang., and Applic. (OOPSLA), 2000.
57. R. Vallée-Rai, E. Gagnon, L. Hendren, P. Lam, P. Pominville, and V. Sundaresan. Optimizing Java bytecode using the Soot framework: Is it feasible? In European Conference for Object-Oriented Prog. (ECOOP), 2000.
58. F. Vivien and M. Rinard. Incrementalized pointer and escape analysis. In Prog. Lang. Design and Impl. (PLDI), 2001.
59. J. Whaley and M. Lam. An efficient inclusion-based points-to analysis for strictlytyped languages. In Static Analysis Symp. (SAS), 2002.