K
Kai Engelhardt
Researcher at University of New South Wales
Publications - 29
Citations - 2541
Kai Engelhardt is an academic researcher from University of New South Wales. The author has contributed to research in topics: Refinement calculus & Correctness. The author has an hindex of 12, co-authored 29 publications receiving 2346 citations. Previous affiliations of Kai Engelhardt include University of Kiel & NICTA.
Papers
More filters
Proceedings ArticleDOI
seL4: formal verification of an OS kernel
Gerwin Klein,Kevin Elphinstone,Gernot Heiser,June Andronick,David Cock,Philip Derrin,Dhammika Elkaduwe,Kai Engelhardt,Rafal Kolanski,Michael Norrish,Thomas Sewell,Harvey Tuch,Simon Winwood +12 more
TL;DR: To the knowledge, this is the first formal proof of functional correctness of a complete, general-purpose operating-system kernel.
Book
Data Refinement: Model-Oriented Proof Methods and their Comparison
W. DeRoever,Kai Engelhardt +1 more
TL;DR: The authors concentrate in the first part on the general principles needed to prove data refinement correct, and begin with an explanation of the fundamental notions, showing that data refinement proofs reduce to proving simulation.
Journal ArticleDOI
seL4: formal verification of an operating-system kernel
Gerwin Klein,June Andronick,Kevin Elphinstone,Gernot Heiser,David Cock,Philip Derrin,Dhammika Elkaduwe,Kai Engelhardt,Rafal Kolanski,Michael Norrish,Thomas Sewell,Harvey Tuch,Simon Winwood +12 more
TL;DR: It is proved that the implementation of the seL4 microkernel always strictly follows the high-level abstract specification of kernel behavior, which encompasses traditional design and implementation safety properties such as that the kernel will never crash, and it will never perform an unsafe operation.
Proceedings Article
Knowledge and the logic of local propositions
TL;DR: A modal logic of local propositions, in which it is possible to quantify over such propositions, is introduced, and it is shown that this logic is able to represent a rich set of epistemic notions.
Proceedings ArticleDOI
COVERN: A Logic for Compositional Verification of Information Flow Control
TL;DR: This paper presents the first foundational, machine-checked proof of IFC security for a non-trivial shared-memory concurrent program, COVERN (Compositional Verification of Noninterference), and its proof of soundness via a new generic framework for general rely-guarantee IFC reasoning.