Abstract
So-called "guarded commands" are introduced as a building block for alternative and repetitive constructs that allow non-deterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state. For the formal derivation of programs expressed in terms of these constructs, a calculus will be shown.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Hoare, C.A.R., An Axiomatic Basis for Computer Programming, Comm.ACM 12 (Oct. 1969) 576–583.
Naur, Peter, (Ed.) Report on the Algorithmic Language ALGOL 60, Comm.ACM 3 (May 1960) 299–314
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dijkstra, E.W. (1976). Guarded commands, non-determinacy and a calculus for the derivation of programs. In: Bauer, F.L., et al. Language Hierarchies and Interfaces. Lecture Notes in Computer Science, vol 46. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07994-7_51
Download citation
DOI: https://doi.org/10.1007/3-540-07994-7_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07994-1
Online ISBN: 978-3-540-37972-0
eBook Packages: Springer Book Archive