Secure Microkernels, State Monads and Scalable Refinement

Authors:
David Cock;Gerwin Klein;Thomas Sewell
Affiliations:
Sydney Research Lab., NICTA, Australia;Sydney Research Lab., NICTA, Australia and School of Computer Science and Engineering, UNSW, Sydney, Australia;Sydney Research Lab., NICTA, Australia
Venue:
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Year:
2008

Citing 13
Cited 14

Kit: A Study in Operating System Verification

IEEE Transactions on Software Engineering
On micro-kernel construction

SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Specification and verification of the UCLA Unix security kernel

Communications of the ACM
Guarded commands, nondeterminacy and formal derivation of programs

Communications of the ACM
A principled approach to operating system construction in Haskell

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
The logic of demand in Haskell

Journal of Functional Programming
Running the manual: an approach to high-assurance microkernel development

Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
Types, bytes, and separation logic

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards a practical, verified kernel

HOTOS'07 Proceedings of the 11th USENIX workshop on Hot topics in operating systems
Data Refinement: Model-Oriented Proof Methods and their Comparison

Data Refinement: Model-Oriented Proof Methods and their Comparison
A generic complete dynamic logic for reasoning about purity and effects

FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
On the correctness of operating system kernels

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Axiomatic constructor classes in Isabelle/HOLCF

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics

Verified Protection Model of the seL4 Microkernel

VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
A Hoare Logic for the State Monad

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Mind the Gap

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Preemption Abstraction

FMICS '09 Proceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems
From a verified kernel towards verified systems

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
seL4 enforces integrity

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Large-scale formal verification in practice: a process perspective

Proceedings of the 34th International Conference on Software Engineering
Challenges and experiences in managing large-scale proofs

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Extensible specifications for automatic re-use of specifications and proofs

SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
Noninterference for operating system kernels

CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
The confinement problem in the presence of faults

ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
On construction of a library of formally verified low-level arithmetic functions

Innovations in Systems and Software Engineering
Practical probability: applying pGCL to lattice scheduling

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Comprehensive formal verification of an OS microkernel

ACM Transactions on Computer Systems (TOCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a scalable, practical Hoare Logic and refinement calculus for the nondeterministic state monad with exceptions and failure in Isabelle/HOL. The emphasis of this formalisation is on large-scale verification of imperative-style functional programs, rather than expressing monad calculi in full generality. We achieve scalability in two dimensions. The method scales to multiple team members working productively and largely independently on a single proof and also to large programs with large and complex properties.We report on our experience in applying the techniques in an extensive (100,000 lines of proof) case study--the formal verification of an executable model of the seL4 operating system microkernel.