Authors
Simon Winwood, Gerwin Klein, Thomas Sewell, June Andronick, David Cock, Michael Norrish
Publication date
2009
Conference
Theorem Proving in Higher Order Logics: 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings 22
Pages
500-515
Publisher
Springer Berlin Heidelberg
Description
This paper presents the formal Isabelle/HOL framework we use to prove refinement between an executable, monadic specification and the C implementation of the seL4 microkernel. We describe the refinement framework itself, the automated tactics it supports, and the connection to our previous C verification framework. We also report on our experience in applying the framework to seL4. The characteristics of this microkernel verification are the size of the target (8,700 lines of C code), the treatment of low-level programming constructs, the focus on high performance, and the large subset of the C programming language addressed, which includes pointer arithmetic and type-unsafe code.
Total citations
20092010201120122013201420152016201720182019202020212022202320242837193365544321
Scholar articles
S Winwood, G Klein, T Sewell, J Andronick, D Cock… - Theorem Proving in Higher Order Logics: 22nd …, 2009