article Open AccessTop 1% cited
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM · 1975 · Vol. 18(8) · pp. 453–457
Abstract
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 be shown.
Logic, programming, and type systemsFormal Methods in VerificationParallel Computing and Optimization TechniquesNondeterministic algorithmProgramming languageComputer scienceState (computer science)Block (permutation group theory)Theoretical computer scienceCalculus (dental)Algebra over a fieldMathematicsPure mathematics
Funding
- National Science Foundation
Citations
1,911
FWCI
90.93
field-weighted impact
References
4
Percentile
100%
vs. same field & year
Citations per year
Cited by
Communicating sequential processes
Communications of the ACM · 1978 · 3,481 citations
Communicating sequential processes
Communications of the ACM · 1983 · 3,781 citations
References
An axiomatic basis for computer programming
Communications of the ACM · 1969 · 3,842 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.