Extensible Proof-Producing Compilation [chapter]

Magnus O. Myreen, Konrad Slind, Michael J. C. Gordon
2009 Lecture Notes in Computer Science  
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the source functions. Unlike previously published work on proof-producing compilation from a theorem prover, our compiler provides broad support for user-defined extensions, targets multiple carefully modelled commercial machine languages, and does not require termination proofs for input functions. As a case study, the
more » ... ompiler is used to construct verified interpreters for a small LISP-like language. The compiler has been implemented in the HOL4 theorem prover.
doi:10.1007/978-3-642-00722-4_2 fatcat:llgpx3b5k5cfncaelpaexo4zcq