Guarded commands, nondeterminacy and formal derivation of programs

@article{Dijkstra1975GuardedCN,
  title={Guarded commands, nondeterminacy and formal derivation of programs},
  author={E. Dijkstra},
  journal={Commun. ACM},
  year={1975},
  volume={18},
  pages={453-457}
}
  • E. Dijkstra
  • Published 1975
  • Computer Science
  • Commun. ACM
  • 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. 
    1,902 Citations

    Topics from this paper.

    Implementations of Nondeterministic Programs
    Semantics of Nondeterministic and Noncontinuous Constructs
    • 51
    Proving Total Correctness of Programs in Weak Second-Order Logic
    • 1
    An Exercise in Transformational Programming: Backtracking and Branch-and-Bound
    • 10
    • PDF
    Semantic Models for Total Correctness and Fairness
    • 1
    Logical reversibility
    • 48
    • PDF
    Semantic Models for Total Correctness and Fairness
    • M. Main, D. Black
    • Computer Science
    • Mathematical Foundations of Programming Semantics
    • 1989
    • 4
    On the Total Correctness of Nondeterministic Programs
    • D. Harel
    • Computer Science
    • Theor. Comput. Sci.
    • 1981
    • 14
    Analysis of infinite loops using S-formulas