lh-l4v/proof/asmrefine
Matthew Brecknell 0102ef172a Isabelle2017: remove String_Compare
This was a workaround for an Isabelle2016-1 performace regression, and
is no longer required.
2017-10-30 12:23:26 +11:00
..
README.md asmrefine: add one README.md, update another. 2017-08-16 18:15:21 +10:00
SEL4GlobalsSwap.thy Isabelle2017: remove String_Compare 2017-10-30 12:23:26 +11:00
SEL4GraphRefine.thy Isabelle2017: remove String_Compare 2017-10-30 12:23:26 +11:00
SEL4SimplExport.thy Isabelle2017: remove String_Compare 2017-10-30 12:23:26 +11:00
TestGraphRefine.thy cspec: Remove redundancy in build rules and theory files for c-kernel builds 2017-09-21 13:23:04 +10:00

README.md

Assembly Refinement Proof

This proof contributes to a larger proof that seL4's compiled binary correctly implements the semantics of its C code. This component of the proof generates (exports) an external version of the C semantics into the SydTV-GL language, and proves that the exported version refines the starting C semantics. A SydTV-GL representation of the binary is created (with proof) by a decompilation tool based on HOL4, and the two representations are compared by the SydTV tool.

An overview of the full proof is given with the SydTV tool. It is also described in the PLDI '13 paper.

These theories are specific to seL4, and build on the more general apparatus in the tools directory.

Important Theories

The SEL4SimplExport theory, when executed, exports the kernel's C semantics into the graph refinement language used by the external graph refinement toolset. The SEL4GraphRefine theory establishes that this exported graph semantics is a formal refinement of the kernel's C semantics.