Advertisement

Integrating real-time scheduling theory and program refinement

  • C. Fidge
  • M. Utting
  • P. Kearney
  • I. Hayes
Session 4b: Z
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1051)

Abstract

We show how real-time schedulability tests and program refinement rules can be integrated to create a formal development method of practical use to real-time programmers. A computational model for representing task scheduling is developed within a ⋆imed’ refinement calculus. Proven multi-tasking schedulability tests then become available as feasibility checks during system refinement.

Keywords

Schedule Policy Periodic Task Sporadic Task Schedule Theory Schedulability Test 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal, 8(5):284–292, September 1993.Google Scholar
  2. 2.
    T.P. Baker. Stack-based scheduling of real-time processes. Real Time Systems, 3(1):67–99, March 1991.Google Scholar
  3. 3.
    J. Bowen, editor. Towards Verified Systems, volume 2 of Real-Time Safety Critical Systems. Elsevier, 1994.Google Scholar
  4. 4.
    A. Burns and A. Wellings. Real-Time Systems and their Programming Languages. Addison-Wesley, 1990.Google Scholar
  5. 5.
    A. Burns and A.J. Wellings. Priority inheritance and message passing communication: A formal treatment. The Journal of Real-Time Systems, 3:19–44, 1991.Google Scholar
  6. 6.
    C. Fidge. Adding real time to formal program development. In M. Naftalin, T. Denvir, and M. Bertran, editors, FME'94: Industrial Benefit of Formal Methods, volume 873 of Lecture Notes in Computer Science, pages 618–638. Springer-Verlag, 1994.Google Scholar
  7. 7.
    J. Hooman. Extending Hoare logic to real-time. Formal Aspects of Computing, 6(6A):801–825, 1994.Google Scholar
  8. 8.
    Ada 9X Mapping/Revision Team Intermetrics. Ada 9X reference manual, draft version 5.0, June 1994.Google Scholar
  9. 9.
    H. Jifeng. Provably Correct Systems. McGraw-Hill, 1995.Google Scholar
  10. 10.
    B. Mahony. Using the refinement calculus for dataflow processes. Technical Report TR 94-32, Software Verification Research Centre, October 1994.Google Scholar
  11. 11.
    B. Mahony. Networks of predicate transformers. Technical Report TR 95-5, Software Verification Research Centre, February 1995.Google Scholar
  12. 12.
    M. Pilling, A. Burns, and K. Raymond. Formal specifications and proofs of inheritance protocols for real-time scheduling. Software Engineering Journal, 5(5), September 1990.Google Scholar
  13. 13.
    D. Scholefield. Proving properties of real-time semaphores. Science of Computer Programming, 24(2):159–181, April 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • C. Fidge
    • 1
  • M. Utting
    • 1
  • P. Kearney
    • 1
  • I. Hayes
    • 1
  1. 1.Software Verification Research Centre, Department of Computer ScienceThe University of QueenslandQueenslandAustralia

Personalised recommendations