Skip to main content
SpringerLink
Log in

A formalism for reasoning about fair termination

extended abstract

  • Conference paper
  • First Online:
Logics of Programs (Logic of Programs 1981)

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

Included in the following conference series:

Abstract

Fair termination can be expressed, hence reasoned about, in Park's monotone μ-calculus, and the fair weakest precondition operator for boolean guarded do-loops is expressed.

The research reported in this paper originated during a visit to the Technion, Haifa, made possible by a grant from its department of Computer Science.

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.

6. References

  • [Apt & Plotkin]: A Cook's tour of countable nondeterminism, proc. ICALP VIII, LNCS 115, 1981.

    Google Scholar 

  • [de Bakker]: Mathematical Foundations of Program Correctness, Prentice-Hall, 1980.

    Google Scholar 

  • [de Bakker & de Roever]: A calculus for recursive program schemes, proc. ICALP I, North-Holland, 1973.

    Google Scholar 

  • [Floyd]: Assigning meaning to programs, J.T. Schwartz (ed.), Math. Aspects of Computer Science, 1967.

    Google Scholar 

  • [Francez & Pnueli]: A proof method for cyclic programs, Acta Informatica 9, 1978.

    Google Scholar 

  • [Grümberg, Francez, Makowski & de Roever]: A proof rule for fair termination of guarded commands, Proc. Symposium on Algorithmic Languages, Amsterdam, 1981, North-Holland.

    Google Scholar 

  • [Hitchcock & Park]: Induction rules and termination, proc. ICALP I, North-Holland, 1973.

    Google Scholar 

  • [Lamport]: Proving the correctness of multiprocess programs, IEEE-TSE 3, 2, 1977.

    Google Scholar 

  • [Lamport & Owicki]: Proving liveness properties of concurrent programs, SRI-TR, 1980.

    Google Scholar 

  • [Park 80]: On the semantics of fair parallellism, LNCS 86, 1980.

    Google Scholar 

  • [Park 81]: A predicate transformer for weak fair iteration, proc. 6th IBM Symposium on Math. Found. of Computer Science, Hakone, Japan, 1981.

    Google Scholar 

  • [Pnueli]: The temporal semantics of concurrent programs, TCS, 13, 1, 1981.

    Google Scholar 

  • [Pnueli, Stavi & Lehmann]: Impartiality, Justice and Fairness: The Ethics of Concurrent Termination, proc. ICALP VIII, LNCS 115, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Utrecht, The Netherlands

    Willem P. de Roever

Authors
  1. Willem P. de Roever
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dexter Kozen

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Roever, W.P. (1982). A formalism for reasoning about fair termination. In: Kozen, D. (eds) Logics of Programs. Logic of Programs 1981. Lecture Notes in Computer Science, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025777

Download citation

  • DOI: https://doi.org/10.1007/BFb0025777

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11212-9

  • Online ISBN: 978-3-540-39047-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation