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.
Preview
Unable to display preview. Download preview PDF.
6. References
[Apt & Plotkin]: A Cook's tour of countable nondeterminism, proc. ICALP VIII, LNCS 115, 1981.
[de Bakker]: Mathematical Foundations of Program Correctness, Prentice-Hall, 1980.
[de Bakker & de Roever]: A calculus for recursive program schemes, proc. ICALP I, North-Holland, 1973.
[Floyd]: Assigning meaning to programs, J.T. Schwartz (ed.), Math. Aspects of Computer Science, 1967.
[Francez & Pnueli]: A proof method for cyclic programs, Acta Informatica 9, 1978.
[Grümberg, Francez, Makowski & de Roever]: A proof rule for fair termination of guarded commands, Proc. Symposium on Algorithmic Languages, Amsterdam, 1981, North-Holland.
[Hitchcock & Park]: Induction rules and termination, proc. ICALP I, North-Holland, 1973.
[Lamport]: Proving the correctness of multiprocess programs, IEEE-TSE 3, 2, 1977.
[Lamport & Owicki]: Proving liveness properties of concurrent programs, SRI-TR, 1980.
[Park 80]: On the semantics of fair parallellism, LNCS 86, 1980.
[Park 81]: A predicate transformer for weak fair iteration, proc. 6th IBM Symposium on Math. Found. of Computer Science, Hakone, Japan, 1981.
[Pnueli]: The temporal semantics of concurrent programs, TCS, 13, 1, 1981.
[Pnueli, Stavi & Lehmann]: Impartiality, Justice and Fairness: The Ethics of Concurrent Termination, proc. ICALP VIII, LNCS 115, 1981.
Author information
Authors and Affiliations
Editor information
Rights 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