Skip to main content
Springer Nature Link
Log in

A formal proof of the Deadline Driven scheduler

  • Conference paper
  • First Online:
Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT 1994, ProCoS 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 863))

Abstract

This paper presents an approach to formalizing and proving real-time properties of schedulers. The formal logic that we propose to use is the Duration Calculus [1], and the scheduler that we select here to serve as an example is the Deadline Driven Scheduling Algorithm [2]. The specification and proof of the algorithm are formulated abstractly by using the Duration Calculus. The result may encourage others to formally treat more real-time aspects of operating systems which are conventionally a piece of ad hoc territory in computer science.

This research is supported by DeTfoRS Project funded by the National Hi-Tech Programme of China and UNU/IIST.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. M.R. Hansen and Zhou Chaochen, Semantics and Completeness of Duration Calculus, Proc. of Real-Time: Theory in Practice, REX Workshop, Mook, the Netherlands, LNCS 600, pp.209–225, 1992.

    Google Scholar 

  2. C.L.Liu and J.W.Layland. Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. J. of ACM.20(1),pp. 46–61. 1973.

    Google Scholar 

  3. Liu Zhiming, Mathai Joseph and Tomasz Janowski, Verification of Schedulability for Real-Time Programs, Technical Report RR245, Department of Computer Science, University of Warwick,1993.

    Google Scholar 

  4. B.Moszkowski: A Temporal Logic for Multi-level Reasoning about Hardware. In IEEE Computer, Vol.18(2),pp10–19, 1985.

    Google Scholar 

  5. J.U. SkakkebÆk, Natarajan Shankar: Towards a Duration Calculus Proof Assistant in PVS, ProCoS II Report ID/DTH JUS 5/1, March 1994

    Google Scholar 

  6. Zhou Chaochen, C.A.R. Hoare and A.P. Ravn, A Calculus of Durations, Information Processing Letters, 40(5):269–276, 1991.

    Google Scholar 

  7. Zhou Chaochen, M.R.Hansen, A.P.Ravn, H.Rischel: Duration Specifications for Shared Processors, Proc.of the Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, Nijmegen, January 1992. LNCS 571,pp 21–32, 1992.

    Google Scholar 

Download references

Author information

Author notes

  1. Zheng Yuhua

    Present address: Department of Computer Science, Nanjing University, 210008, Nanjing, P.R.China

Authors and Affiliations

  1. International Institute for Software Technology, The United Nations University, P.O.Box 3058, Macau

    Zheng Yuhua & Zhou Chaochen

Authors
  1. Zheng Yuhua
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhou Chaochen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans Langmaack Willem-Paul de Roever Jan Vytopil

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yuhua, Z., Chaochen, Z. (1994). A formal proof of the Deadline Driven scheduler. In: Langmaack, H., de Roever, WP., Vytopil, J. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT ProCoS 1994 1994. Lecture Notes in Computer Science, vol 863. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58468-4_194

Download citation

  • DOI: https://doi.org/10.1007/3-540-58468-4_194

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58468-1

  • Online ISBN: 978-3-540-48984-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation