Annotating Java libraries in support of whole-program optimization

Authors:
Michael Thies
Affiliations:
Universität Paderborn, Paderborn, Germany
Venue:
PPPJ '02/IRE '02 Proceedings of the inaugural conference on the Principles and Practice of programming, 2002 and Proceedings of the second workshop on Intermediate representation engineering for virtual machines, 2002
Year:
2002

Citing 7
Cited 0

Slim binaries

Communications of the ACM
Java annotation-aware just-in-time (AJIT) complilation system

JAVA '99 Proceedings of the ACM 1999 conference on Java Grande
A framework for interprocedural optimization in the presence of dynamic class loading

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Field analysis: getting useful and low-cost interprocedural information

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Adaptive optimization in the Jalapeño JVM

OOPSLA '00 Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Sealed calls in Java packages

OOPSLA '00 Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
SafeTSA: a type safe and referentially secure mobile-code representation based on static single assignment form

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimizing just-in-time compilation of Java programs depends on information gained from state-of-the-art program analysis techniques. To avoid extensive analysis at program execution time, analysis results for the available parts of a program can be precomputed at compile time and then combined at runtime. Program analyses operate on isolated program modules like libraries and annotate them with information that can be post-processed efficiently. We have applied this approach to several concrete analysis problems and have analyzed real world Java libraries and application programs. The precomputed information shows low complexity and benign dependency structures that allow for fast composition and effective optimization at runtime.