A framework for interprocedural optimization in the presence of dynamic class loading
Vugranam C. Sreedhar, Michael Burke, Jong-Deok Choi · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 2000
Dynamic class loading during program execution in the Java Programming Language is an impediment for generating code that is as efficient as code generated using static whole-program analysis and optimization. Whole-program analysis and optimization is possible for languages, such as C++, that do not allow new classes and/or methods to be loaded during program execution. One solution for performing whole-program analysis and avoiding incorrect execution after a new class is loaded is to invalidate and recompile affected methods. Runtime invalidation and recompilation mechanisms can be expensive in both space and time, and, therefore, generally restrict optimization.
Cited by 66 works. doi:10.1145/349299.349326 Open-access PDF
Authors
References
- The Java Language Specification
- Efficiently computing static single assignment form and the control dependence graph
- Points-to analysis in almost linear time
- Analysis of pointers and structures
- Efficient context-sensitive pointer analysis for C programs
- Context-sensitive interprocedural points-to analysis in the presence of function pointers
- A safe approximate algorithm for interprocedural aliasing
- Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects
- A general approach for run-time specialization and its application to C
- A safe approximate algorithm for interprocedural pointer aliasing