adbrucker
/
lh-l4v
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
lh-l4v/proof/asmrefine
History
Gerwin Klein ba38ae33ab update publications links 
The links to nicta.com.au have stopped working, so the publication links
now point to the TS publication pages.

Signed-off-by: Gerwin Klein <gerwin.klein@data61.csiro.au>
 		2020-11-23 17:06:46 +11:00
..
export SimplExport: export and import are in different dirs 2020-10-27 15:52:31 +10:00
README.md update publications links 2020-11-23 17:06:46 +11:00
SEL4GlobalsSwap.thy asmrefine: add `heap_update` identity rule 2020-09-07 14:10:04 +10:00
SEL4GraphRefine.thy proof/ROOT: more Isabelle2020 session structure 2020-10-27 15:52:31 +10:00
TestGraphRefine.thy proof/ROOT: more Isabelle2020 session structure 2020-10-27 15:52:31 +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.