Seminar details

Room 206 (2nd floor, badged access)

9 July 2019 - 14h00
Integrating Formal Schedulability Analysis into a Verifed OS Kernel
by Lionel Rieg from VERIMAG

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. Here, 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.

Contact | Site Map | Site powered by SPIP 3.2.15 + AHUNTSIC [CC License]

info visites 1862582