Guarded commands, nondeterminacy and formal derivation of programs

  • Authors:
  • Edsger W. Dijkstra

  • Affiliations:
  • Burroughs Corp., Nuenen, The Netherlands

  • Venue:
  • Communications of the ACM
  • Year:
  • 1975

Quantified Score

Hi-index 48.43

Visualization

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.