论文信息 - A Machine-Checked Proof of the Optimality of a Real-Time Scheduling Policy

A Machine-Checked Proof of the Optimality of a Real-Time Scheduling Policy

We describe a mechanically-checked proof of the optimality of earliest-deadline-first (EDF) schedulers on periodic tasks accomplished using the Nqthm theorem prover. We present a formalization of the theorem and discuss why the machine-checked proof is both more complex and more reliable than a corresponding informal proof.

Matthew Wilding | M. Wilding

[1] John Rushby,et al. User guide for the pvs specification and verification system (beta release) , 1991 .

[2] Robert S. Boyer,et al. A computational logic handbook , 1979, Perspectives in computing.

[3] James W. Layland,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[4] Matt Kaufmann. An Interactive Enhancement to the Boyer-Moore Theorem Prover , 1988, CADE.

[5] Matthew Wilding,et al. A Mechanically-Checked Correctness Proof of a Floating-Point Search Program , 1990 .