POPL 2020 (series) / CoqPL 2020 (series) / The Sixth International Workshop on Coq for Programming Languages /
Towards Formally Verified Just-in-Time compilation
Sat 25 Jan 2020 15:35 - 16:05 at Maurepas - Contributed Talks & Coq Developers Chair(s): Robbert Krebbers, Joseph Tassarotti
Just-in-Time compilation consists in interleaving program interpretation and compilation at run-time, to achieve better performance than standard interpretation. While some of the execution time is spent compiling, a JIT compiler can leverage run-time information to make speculative optimizations. These optimizations create optimized versions of functions given some assumptions. While static compilers have been the topic of many formal verification works, few have tackled JIT compilation verification. We present our ongoing work about formal verification of a Just-in-Time compiler.
slides_coqpl20 (pres.pdf) | 834KiB |
(coqpl20-final5.pdf) | 360KiB |
Sat 25 JanDisplayed time zone: Saskatchewan, Central America change
Sat 25 Jan
Displayed time zone: Saskatchewan, Central America change
15:35 - 17:45 | Contributed Talks & Coq DevelopersCoqPL at Maurepas Chair(s): Robbert Krebbers Delft University of Technology, Joseph Tassarotti Boston College | ||
15:35 30mTalk | Towards Formally Verified Just-in-Time compilation CoqPL Aurèle Barrière Univ Rennes, IRISA, Sandrine Blazy Univ Rennes- IRISA, David Pichardie Univ Rennes, ENS Rennes, IRISA File Attached | ||
16:05 30mTalk | A Coq Library of Undecidable Problems CoqPL Yannick Forster Saarland University, Dominique Larchey-Wendling CNRS, LORIA, Andrej Dudenhefner Saarland University, Edith Heiter Saarland University, Dominik Kirst Saarland University, Fabian Kunze Saarland University, Gert Smolka Saarland University, Simon Spies Saarland University, Dominik Wehr Saarland University, Universiteit van Amsterdam, Maximilian Wuttke Saarland University Media Attached File Attached | ||
16:35 15mBreak | Short break CoqPL | ||
16:50 45mDemonstration | Session with the Coq Development Team CoqPL |