1975/08/01 by Edsger W. Dijkstra · 8 citations
Computer Science · #Logic, programming, and type systems #Formal Methods in Verification #Parallel Computing and Optimization Techniques
paper · pdf · doi:10.1145/360933.360975
openalex publication_date 1975/08/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/01
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.