Results 1 
2 of
2
A MachineChecked Proof of the Optimality of a RealTime Scheduling Policy
 In ComputerAided Verification – CAV’98
, 1998
"... . We describe a mechanicallychecked proof of the optimality of earliestdeadlinefirst (EDF) schedulers on periodic tasks accomplished using the Nqthm theorem prover. We present a formalization of the theorem and discuss why the machinechecked proof is both more complex and more reliable than a co ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
. We describe a mechanicallychecked proof of the optimality of earliestdeadlinefirst (EDF) schedulers on periodic tasks accomplished using the Nqthm theorem prover. We present a formalization of the theorem and discuss why the machinechecked proof is both more complex and more reliable than a corresponding informal proof. 1 Introduction Realtime applications often have several required functions with different timing constraints. In a seminal paper for building realtime systems, Liu and Layland introduce abstractions that facilitate realtime application development [4]. Using a simple computation model, they exhibit different realtime scheduling policies that choose which of an application's various tasks to assign a processor and argue that these policies have certain useful properties. One scheduling policy is earliestdeadlinefirst (EDF), which assigns the processor to a task that has earliest deadline among the tasks that are currently running. An EDF scheduler is optimal...