Proof-Producing Synthesis of CakeML from Monadic HOL Functions
Artikel i vetenskaplig tidskrift, 2020

We introduce an automatic method for producing stateful ML programs together with proofs of correctness from monadic functions in HOL. Our mechanism supports references, exceptions, and I/O operations, and can generate functions manipulating local state, which can then be encapsulated for use in a pure context. We apply this approach to several non-trivial examples, including the instruction encoder and register allocator of the otherwise pure CakeML compiler, which now benefits from better runtime performance. This development has been carried out in the HOL4 theorem prover.

ML

Interactive theorem proving

Higher-order logic

Program synthesis

Författare

Oskar Abrahamsson

Chalmers, Data- och informationsteknik, Formella metoder

Son Ho

Université PSL

Hrutvik Kanabar

University Of Kent

Ramana Kumar

DeepMind

Magnus Myreen

Chalmers, Data- och informationsteknik, Formella metoder

Michael Norrish

Australian National University

Yong Kiam Tan

Carnegie Mellon University (CMU)

Journal of Automated Reasoning

0168-7433 (ISSN) 1573-0670 (eISSN)

Vol. In Press

Ämneskategorier

Datorteknik

Datavetenskap (datalogi)

Matematisk analys

DOI

10.1007/s10817-020-09559-8

Mer information

Senast uppdaterat

2020-07-17