Integrating Formal Schedulability Analysis into a Verified OS Kernel

Abstract : Formal verification of real-time systems is attractive because these systems often perform critical operations. Unlike non real-time systems, latency and response time guarantees are of critical importance in this setting, as much as functional correctness. Nevertheless, formal verification of real-time OSes usually stops the scheduling analysis at the policy level: they only prove that the scheduler (or its abstract model) satisfies some scheduling policy. In this paper, we go further and connect together Prosa, a verified schedulability analyzer, and RT-CertiKOS, a verified single-core sequential real-time OS kernel. Thus, we get a more general and extensible schedulability analysis proof for RT-CertiKOS, as well a concrete implementation validating Prosa models. It also showcases that it is realistic to connect two completely independent formal developments in a proof assistant.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02289494
Contributor : Lionel Rieg <>
Submitted on : Monday, September 16, 2019 - 6:35:12 PM
Last modification on : Friday, January 10, 2020 - 12:02:40 PM

Links full text

Identifiers

Citation

Xiaojie Guo, Maxime Lesourd, Mengqi Liu, Lionel Rieg, Zhong Shao. Integrating Formal Schedulability Analysis into a Verified OS Kernel. Computer Aided Verification, Jul 2019, New York, United States. pp.496-514, ⟨10.1007/978-3-030-25543-5_28⟩. ⟨hal-02289494⟩

Share

Metrics

Record views

80