lh-l4v/proof/asmrefine
Gerwin Klein 8d12d8e4be licenses: tag .md and document file 2020-03-02 18:52:15 +08:00
..
README.md licenses: tag .md and document file 2020-03-02 18:52:15 +08:00
SEL4GlobalsSwap.thy Isabelle2018: new AsmRefine session + test 2018-08-20 09:06:36 +10:00
SEL4GraphRefine.thy asmrefine: clean up SEL4GraphRefine 2019-12-19 17:05:10 +11:00
SEL4SimplExport.thy asmrefine: arch split CFunDump files 2019-12-19 17:05:10 +11:00
TestGraphRefine.thy asmrefine: improve debugging 2019-12-19 17:05:10 +11: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.