Authors
Toby Murray, Daniel Matichuk, Matthew Brassil, Peter Gammie, Gerwin Klein
Publication date
2012
Conference
Certified Programs and Proofs: Second International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012. Proceedings 2
Pages
126-142
Publisher
Springer Berlin Heidelberg
Description
While intransitive noninterference is a natural property for any secure OS kernel to enforce, proving that the implementation of any particular general-purpose kernel enforces this property is yet to be achieved. In this paper we take a significant step towards this vision by presenting a machine-checked formulation of intransitive noninterference for OS kernels, and its associated sound and complete unwinding conditions, as well as a scalable proof calculus over nondeterministic state monads for discharging these unwinding conditions across a kernel’s implementation. Our ongoing experience applying this noninterference framework and proof calculus to the seL4 microkernel validates their utility and real-world applicability.
Total citations
2012201320142015201620172018201920202021202220232024251059109474473
Scholar articles
T Murray, D Matichuk, M Brassil, P Gammie, G Klein - Certified Programs and Proofs: Second International …, 2012