PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 11, 20091,594 citations

seL4

View Full Paper
GKGerwin KleinKEKevin ElphinstoneGHGernot Heiser

Key Points

Key points are not available for this paper at this time.

Abstract

Complete formal verification is the only known way to guarantee that a system is free of programming errors.We present our experience in performing the formal, machine-checked verification of the seL4 microkernel from an abstract specification down to its C implementation. We assume correctness of compiler, assembly code, and hardware, and we used a unique design approach that fuses formal and operating systems techniques. To our knowledge, this is the first formal proof of functional correctness of a complete, general-purpose operating-system kernel. Functional correctness means here that the implementation always strictly follows our high-level abstract specification of kernel behaviour. This encompasses traditional design and implementation safety properties such as the kernel will never crash, and it will never perform an unsafe operation. It also proves much more: we can predict precisely how the kernel will behave in every possible situation.seL4, a third-generation microkernel of L4 provenance, comprises 8,700 lines of C code and 600 lines of assembler. Its performance is comparable to other high-performance L4 kernels.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Klein et al. (2009) studied this question.

synapsesocial.com/papers/6997eec3be1be0234d32ff61https://doi.org/10.1145/1629575.1629596
Ask AI
Helpful
Bookmark
Share
View Full Paper