A machine-checked proof of the optimality of a real-time scheduling policy

  • Matthew Wilding
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1427)


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.


  1. 1.
    R. S. Boyer and J S. Moore. A Computational Logic Handbook. Academic Press, Boston, 1988.Google Scholar
  2. 2.
    R. S. Boyer and J S. Moore. Chapter 14 of A Computational Logic Handbook, 2nd edition. Academic Press, Boston, 1997. (Distributed in Nqthm-1992 release available from Computational Logic, Inc.).Google Scholar
  3. 3.
    Matthew Kaufmann. A user's manual for an interactive enhancement to the Boyer-Moore theorem prover. Technical Report 19, Computational Logic, Inc., May 1988.Google Scholar
  4. 4.
    C.L. Liu and James W. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the Association for Computing Machinery, 20(1):46–61, 1973.Google Scholar
  5. 5.
    S. Owre, N. Shankar, and J. M. Rushby. User Guide for the PVS Specification and Verification System (Beta Release). Computer Science Laboratory, SRI International, Menlo Park, CA, February 1993.Google Scholar
  6. 6.
    Matthew Wilding. A mechanically-checked correctness proof of a floating-point search program. Technical Report 56, Computational Logic, Inc., May 1990.Google Scholar
  7. 7.
    Matthew Wilding. Proving Matijasevich's lemma with a default arithmetic strategy. Journal of Automated Reasoning, 7(3), September 1991.Google Scholar
  8. 8.
    Matthew Wilding. Machine-Checked Real-Time System Verification. PhD thesis, University of Texas, May 1996. Scholar
  9. 9.
    Zheng Yuhua and Zhou Chaochen. A formal proof of the deadline driven scheduler. Formal Techniques in Real-Time and Fault-Tolerant Systems, Third International Symposium, pages 756–775, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  1. 1.The University of TexasAustin

Personalised recommendations