Abstract
This paper presents a series of topics in which Dijkstra’s calculus of guarded commands is generalized and applied in various ways. Many proofs are left to the reader, in order to survey the topics without getting bogged down in details.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R.J.R. Back, J. von Wright. Combining Angels, Demons, and Miracles in Program Specifications. Inst. for Informationsbehandling, Lemminkainengatan 14, SF-20520 Abo, Finland. ISBN 952-649-626-1. 1989.
M. Broy. A theory for nondeterminism, parallelism, communication, and concurrency. TCS 45, 1986, pp. 1–61.
Manfred Broy and Greg Nelson. Can fair choice be added to Dijkstra’s calculus? Research Report 38, Digital Systems Research Center, February 1989.
K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1989.
J. W. deBakker. Semantics and termination of nondeterministic recursive programs. Automata, Languages, and Programming, Edinburgh, 1976.
Edsger W. Dijkstra and Carel S. Scholten. Predicate Calculus and Program Semantics, Springer-Verlag, 1990.
H. Egli. A mathematical model for nondeterministic computations. Zuric, ETH (1975). Cited by deBakker [4].
Peter Hitchcock and David Park. Induction Rules and Termination Proofs. IRIA Conf. Autom. Lang. and Program. Theory. France, 1972.
J.L. Lassez, V.L. Nguyen, and E. A. Sonenberg. Fixed point theorems and semantics: a folk tale. Information Processing Letters vol. 14 no. 3, May 1982.
J. McCarthy. Towards a mathematical science of computation. In P. Braffort, D. Hirschberg (eds.): Computer Programming and Formal Systems, Amsterdam, North-Holland 1963. pp. 33–70.
Mark Manasse and Greg Nelson. Correct compilation of control structures. Bell Labs Technical Memorandum, September 9, 1984.
Greg Nelson. A generalization of Dijkstra’s calculus. TOPLAS 11, October 1989, pp. 517–61.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nelson, G. (1992). Some generalizations and applications of Dijkstra’s guarded commands. In: Broy, M. (eds) Programming and Mathematical Method. NATO ASI Series, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77572-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-77572-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-77574-1
Online ISBN: 978-3-642-77572-7
eBook Packages: Springer Book Archive