Formally verified speculation and deoptimization in a JIT compiler - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Proceedings of the ACM on Programming Languages Year : 2021

Formally verified speculation and deoptimization in a JIT compiler

Abstract

Just-in-time compilers for dynamic languages routinely generate code under assumptions that may be invalidated at run-time, this allows for specialization of program code to the common case in order to avoid unnecessary overheads due to uncommon cases. This form of software speculation requires support for deoptimization when some of the assumptions fail to hold. This paper presents a model just-in-time compiler with an intermediate representation that explicits the synchronization points used for deoptimization and the assumptions made by the compiler's speculation. We also present several common compiler optimizations that can leverage speculation to generate improved code. The optimizations are proved correct with the help of a proof assistant. While our work stops short of proving native code generation, we demonstrate how one could use the verified optimization to obtain significant speed ups in an end-to-end setting.
Fichier principal
Vignette du fichier
popl21main-p383-p-e6099d7-48645-final.pdf (398.42 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03185848 , version 1 (30-03-2021)

Identifiers

Cite

Aurèle Barrière, Sandrine Blazy, Olivier Flückiger, David Pichardie, Jan Vitek. Formally verified speculation and deoptimization in a JIT compiler. Proceedings of the ACM on Programming Languages, 2021, 5 (POPL), pp.26. ⟨10.1145/3434327⟩. ⟨hal-03185848⟩
368 View
285 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More