A Machine-Checked Proof of the Optimality of a Real-Time Scheduling Policy
No abstract available.
Related papers
- Integrating Formal Schedulability Analysis into a Verified OS Kernel CAV 2019
- The Embedded Machine: Predictable, Portable Real-Time Code PLDI 2002
- Formally verified superblock scheduling CPP 2022
- The embedded machine: Predictable, portable real-time code TOPLAS 2007
- Real-time Proof Checking for Distributed Incremental SAT Solving TACAS 2026
- Optimal Choice of When to Garbage Collect TOPLAS 2019
- Scheduling Time-Critical Instructions on RISC Machines POPL 1990
- Scheduling Time-Critical Instructions on RISC Machines TOPLAS 1993