Trace-based JIT compilers identify frequently executed program paths at run-time and subsequently record, compile and optimize their execution. In order to improve the performance of the generated machine instructions, JIT compilers heavily rely on dynamic analysis of the code. Existing work treats the components of a JIT compiler as a monolithic whole, tied to particular execution semantics. We propose a formal framework that facilitates the design and implementation of a tracing JIT compiler and its accompanying dynamic analyses by decoupling the tracing, optimization, and interpretation processes. This results in a framework that is more configurable and extensible than existing formal tracing models. We formalize the tracer and interpreter as two abstract state machines that communicate through a minimal, well-defined interface. Developing a tracing JIT compiler becomes possible for arbitrary interpreters that implement this interface. The abstract machines also provide the necessary hooks to plug in custom analyses and optimizations.
Original languageEnglish
Title of host publicationProceedings of the 13th International Workshop on Dynamic Analysis (WODA)
Place of PublicationNew York, NY, USA
Number of pages6
ISBN (Print)978-1-4503-3909-4
Publication statusPublished - 26 Oct 2015
Event13th International Workshop on Dynamic Analysis (WODA15) - Sheraton Station Square Hotel, Pittsburgh, PA, United States
Duration: 26 Oct 201526 Oct 2015


Workshop13th International Workshop on Dynamic Analysis (WODA15)
CountryUnited States
CityPittsburgh, PA

    Research areas

  • just-in-time compilation, virtual machine

ID: 13985287