“seL4: Formal Verification of an OS Kernel”
E850681
“seL4: Formal Verification of an OS Kernel” is a landmark research paper that presents the first formally verified, general-purpose microkernel, demonstrating end-to-end mathematical proofs of its functional correctness and security properties.
All labels observed (1)
| Label | Occurrences |
|---|---|
| “seL4: Formal Verification of an OS Kernel” canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T10216158 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: “seL4: Formal Verification of an OS Kernel” Context triple: [Gerwin Klein, notablePublication, “seL4: Formal Verification of an OS Kernel”]
-
A.
Kernel Self Protection Project
The Kernel Self Protection Project is a security-focused initiative aimed at hardening the Linux kernel against vulnerabilities and exploitation through proactive defensive features and development practices.
-
B.
Program Verification: Approaches and Tools
"Program Verification: Approaches and Tools" is a foundational work in computer science that systematically presents methods and practical techniques for proving the correctness of software programs.
-
C.
Verification of Concurrent Programs
"Verification of Concurrent Programs" is a foundational computer science text that presents formal methods and techniques for proving the correctness of programs that execute concurrently.
-
D.
the "Reflections on Trusting Trust" lecture and paper
"Reflections on Trusting Trust" is Ken Thompson’s influential 1984 Turing Award lecture and paper that exposed how a compiler could be maliciously modified to invisibly insert security vulnerabilities, fundamentally shaping thinking about software trust and supply-chain security.
-
E.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: “seL4: Formal Verification of an OS Kernel” Target entity description: “seL4: Formal Verification of an OS Kernel” is a landmark research paper that presents the first formally verified, general-purpose microkernel, demonstrating end-to-end mathematical proofs of its functional correctness and security properties.
-
A.
Kernel Self Protection Project
The Kernel Self Protection Project is a security-focused initiative aimed at hardening the Linux kernel against vulnerabilities and exploitation through proactive defensive features and development practices.
-
B.
Program Verification: Approaches and Tools
"Program Verification: Approaches and Tools" is a foundational work in computer science that systematically presents methods and practical techniques for proving the correctness of software programs.
-
C.
Verification of Concurrent Programs
"Verification of Concurrent Programs" is a foundational computer science text that presents formal methods and techniques for proving the correctness of programs that execute concurrently.
-
D.
the "Reflections on Trusting Trust" lecture and paper
"Reflections on Trusting Trust" is Ken Thompson’s influential 1984 Turing Award lecture and paper that exposed how a compiler could be maliciously modified to invisibly insert security vulnerabilities, fundamentally shaping thinking about software trust and supply-chain security.
-
E.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf | research paper ⓘ |
| contribution |
demonstration of feasibility of large-scale formal verification in systems software
ⓘ
end-to-end functional correctness proof of an OS kernel ⓘ first formally verified general-purpose microkernel ⓘ linking of high-level specification to C implementation ⓘ machine-checked security properties of an OS kernel ⓘ |
| describes | seL4 microkernel NERFINISHED ⓘ |
| field |
computer security
ⓘ
formal methods ⓘ operating systems ⓘ software verification ⓘ |
| focusesOn |
C implementation verification
ⓘ
formal specification ⓘ functional correctness proofs ⓘ microkernel design ⓘ performance evaluation of verified kernels ⓘ proof automation ⓘ security properties ⓘ |
| goal |
eliminate entire classes of low-level implementation bugs in the kernel
ⓘ
provide mathematically proved guarantees about kernel behavior ⓘ |
| impact |
demonstrated practicality of large-scale machine-checked proofs for real-world code
ⓘ
influenced research on verified operating systems ⓘ inspired industrial interest in high-assurance microkernels ⓘ landmark in formal verification of systems software ⓘ |
| kernelProperty |
capability-based access control
ⓘ
performance comparable to unverified microkernels ⓘ small trusted computing base ⓘ |
| kernelType | general-purpose microkernel ⓘ |
| method |
Isabelle/HOL theorem prover
NERFINISHED
ⓘ
interactive theorem proving ⓘ |
| propertyVerified |
control-flow integrity at the kernel level
ⓘ
functional correctness ⓘ information-flow related security properties (in later extensions building on the paper) ⓘ memory safety ⓘ |
| relatedTo |
L4 microkernel family
NERFINISHED
ⓘ
capability systems ⓘ high-assurance systems ⓘ safety-critical systems ⓘ |
| shortTitle | seL4 NERFINISHED ⓘ |
| shows |
absence of certain classes of bugs such as null-pointer dereferences and buffer overflows in the verified kernel code
ⓘ
functional correctness of seL4 kernel implementation ⓘ refinement from abstract specification to executable C code ⓘ that high assurance and high performance can be combined in an OS kernel ⓘ |
| title | seL4: Formal Verification of an OS Kernel NERFINISHED ⓘ |
| verificationTarget |
C implementation of the seL4 kernel
ⓘ
abstract specification of kernel behavior ⓘ refinement chain from specification to implementation ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: “seL4: Formal Verification of an OS Kernel” Description of subject: “seL4: Formal Verification of an OS Kernel” is a landmark research paper that presents the first formally verified, general-purpose microkernel, demonstrating end-to-end mathematical proofs of its functional correctness and security properties.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.