PYE: A Framework for Precise-Yet-Efficient Just-In-Time Analyses for Java Programs
Languages like Java and C# follow a two-step process of compilation: static compilation and just-in-time (JIT) compilation. As the time spent in JIT compilation gets added to the execution-time of the application, JIT compilers typically sacrifice the precision of program analyses for efficiency. e alternative of performing the analysis for the whole program statically, ignores the analysis of libraries (available only at runtime), and thereby generates imprecise results. To address these issues, in this paper, we propose a two-step (static+JIT) analysis framework called PYE that helps generate precise analysis-results at runtime, at a very low cost.
PYE achieves the twin objectives of precision and performance during JIT compilation, by using a two- pronged approach: (i) It performs expensive analyses during static compilation, while accounting for the unavailability of the runtime libraries by generating partial results, in terms of conditional values, for the input application. (ii) During JIT compilation, PYE resolves the conditions associated with these values, using the pre-computed conditional values for the libraries, to generate the final results. We have implemented the static and the runtime components of PYE in the Soot optimization framework and the OpenJDK HotSpot Server Compiler (C2), respectively. We demonstrate the usability of PYE by instantiating it to perform two context-, flow-, and field-sensitive heap-based analyses: (i) points-to analysis for null-dereference-check elimination; and (ii) escape analysis for synchronization elimination. We evaluate these instantiations against their corresponding state-of-the-art implementations in C2 over a wide range of benchmarks. The extensive evaluation results show that our strategy works quite well and fulfils both the promises it makes: enhanced precision while maintaining efficiency during JIT compilation.
Fri 25 OctDisplayed time zone: Beirut change
14:00 - 15:30
|Design, Implementation, and Application of GPU-Based Java Bytecode Interpreters|
Ahmet Celik The University of Texas at Austin, Pengyu Nie The University of Texas at Austin, Chris Rossbach The University of Texas at Austin and VMware Research Group, Milos Gligoric The University of Texas at AustinDOI
|Initialize Once, Start Fast: Application Initialization at Build Time|
Christian Wimmer Oracle Labs, Codrut Stancu Oracle Labs, Peter Hofer Oracle Labs, Vojin Jovanovic Oracle Labs, Paul Wögerer Oracle Labs, Peter B. Kessler Oracle Labs, Oleg Pliss Oracle Labs, Thomas Wuerthinger Oracle LabsDOI Pre-print
|Reliable and Fast DWARF-Based Stack Unwinding|
OOPSLALink to publication DOI File Attached
|PYE: A Framework for Precise-Yet-Efficient Just-In-Time Analyses for Java ProgramsTOPLAS|