A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf
.
Extensible Proof-Producing Compilation
[chapter]
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
doi:10.1007/978-3-642-00722-4_2
fatcat:llgpx3b5k5cfncaelpaexo4zcq