Dijkstra: guarded commands and a calculus for deriving programs

What changed

A guarded-command language linked nondeterministic alternatives and repetition to weakest-precondition reasoning, with invariants and variants connecting desired results to program construction.

Scientific scope

A guarded-command language linked nondeterministic alternatives and repetition to weakest-precondition reasoning, with invariants and variants connecting desired results to program construction. The 1975 calculus applies to its specified program constructs. Invariants and variants still require invention; it is not an automatic program-synthesis algorithm or a proof that every program can be developed this way.

Evidence

Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.

Contributors

• Edsger W. Dijkstra · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.

• Edsger W. Dijkstra, Guarded commands, non-determinacy and formal derivation of programs (1975)

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction