Work

RefinedProsa: Connecting Response-Time Analysis with C Verification for Interrupt-Free Schedulers

Year: 2025

Type: article

Abstract: There has been a recent upsurge of interest in formal, machine-checked verification of timing guarantees for C implementations of real-time system schedulers. However, prior work has only considered tick-based schedulers, which enjoy a clearly defined notion of time: the time “quantum”. In this work, we present a new approach to real-time systems verification for interrupt-free schedulers , which are commonly used in deeply embedded and resource-constrained systems but which do not enjoy a natural notion of periodic time. Our approach builds on and connects two recently developed Rocq-based systems—RefinedC (for foundational C verification) and Prosa (for verified response-time analysis)—adapting the former to reason about timed traces and the latter to reason about overheads. We apply the resulting system, which we call RefinedProsa , to verify Rössl, a simple yet representative, fixed-priority, non-preemptive, interrupt-free scheduler implemented in C.

Source: Proceedings of the ACM on Programming Languages

DOI: 10.1145/3729249

Authors: Kimaya Bedarkar, Laila Elbeheiry, Michael Sammler, Lennard Gäher, Björn Brandenburg, Derek Dreyer, Deepak Garg

Institutions: Max Planck Institute for Software Systems, Institute of Science and Technology Austria, ETH Zurich

Language: English

Topic: Real-Time Systems Scheduling

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: European Commission

OpenAlex ID: W4411267930

FWCI: 0.945

Cites: 37

Cited by: 2

Related to: 10