Guarded Commands, Nondeterminacy, and Formal Derivation of Programs

Part of the Texts and Monographs in Computer Science book series (MCS)


So-called “guarded commands” are introduced as a building block for alternative and repetitive constructs that allow nondeterministic 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.


Boolean Function Variant Function Assignment Statement Statement List Formal Derivation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc 1978

Authors and Affiliations

  1. 1.Burroughs CorporationUSA

Personalised recommendations