Kimaya Bedarkar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kimaya Bedarkar has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Björn B. Brandenburg
Real-Time Systems Group, Max Planck Institute for Software Systems
1 shared publication - Deepak Garg
MPI-SWS, Saarbrücken, Germany
1 shared publication - Derek Dreyer
MPI-SWS, Saarland Informatics Campus, Germany
1 shared publication - Laila Elbeheiry
MPI-SWS, Saarbrücken, Germany
1 shared publication - Lennard Gäher
MPI-SWS, Saarland Informatics Campus, Germany
1 shared publication - Michael Sammler
IST Austria, Klosterneuburg, Austria
1 shared publication
Latest Publications
- Open Access
- 10 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 9 (PLDI) , 73-97
RefinedProsa: Connecting Response-Time Analysis with C Verification for Interrupt-Free Schedulers
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.
- 10 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 9 (PLDI) , 73-97
Open AccessRefinedProsa: Connecting Response-Time Analysis with C Verification for Interrupt-Free Schedulers
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.