Proving fairness and implementation correctness of a microkernel scheduler
From MaRDI portal
Recommendations
Cites work
- A formulation of the simple theory of types
- An introduction to mathematical logic and type theory: To truth through proof.
- Balancing the load. Leveraging a semantics stack for systems verification
- Formal Pervasive Verification of a Paging Mechanism
- HOL-Boogie — An Interactive Prover for the Boogie Program-Verifier
- Isabelle/HOL. A proof assistant for higher-order logic
- Logic for Programming, Artificial Intelligence, and Reasoning
- Operating system verification---an overview
- Realistic Worst-Case Execution Time Analysis in the Context of Pervasive System Verification
- Secure Microkernels, State Monads and Scalable Refinement
- Using XCAP to Certify Realistic Systems Code: Machine Context Management
- Verifying a signature architecture: a comparative case study
Cited in
(6)- HOL-Boogie -- an interactive prover-backend for the verifying C compiler
- Balancing the load. Leveraging a semantics stack for systems verification
- An intuitive formal proof for deadline driven scheduler
- Proof of OS scheduling behavior in the presence of interrupt-induced concurrency
- A corrigendum to: ``Sticky-ERfair: a task-processor affinity aware proportional fair scheduler
- Priority inheritance protocol proved correct
Describes a project that uses
Uses Software
This page was built for publication: Proving fairness and implementation correctness of a microkernel scheduler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835766)