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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1427 LNCS, Issue , 1998, Pages 369-378

  Wilding, Matthew ^a,b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b ROCKWELL COLLINS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING; SCHEDULING ALGORITHMS;

EARLIEST DEADLINE FIRST SCHEDULERS; INFORMAL PROOFS; MACHINE-CHECKED PROOFS; OPTIMALITY; PERIODIC TASKS; REAL - TIME SCHEDULING; THEOREM PROVERS;

COMPUTER AIDED ANALYSIS;

EID: 22044443520     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028759     Document Type: Conference Paper

References (9)

1. R. S. Boyer and J S. Moore. A Computational Logic Handbook. Academic Press, Boston, 1988.
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.).
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.
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.
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.
6. Matthew Wilding. A mechanically-checked correctness proof of a floating-point search program. Technical Report 56, Computational Logic, Inc., May 1990.
7. Matthew Wilding. Proving Matijasevich's lemma with a default arithmetic strategy. Journal of Automated Reasoning, 7(3), September 1991.
8. Matthew Wilding. Machine-Checked Real-Time System Verification. PhD thesis, University of Texas, May 1996. ftp.cs.utexas.edu/pub/boyer/wilding-diss. ps.gz.
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.