An Axiomatic Basis for Computer Programming.¶
Hoare, C. A. R. (1969). An Axiomatic Basis for Computer Programming. Communications of the ACM, 12(10), 576-580.
Cited by¶
8 citations across 8 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Algorithm
- The correctness-and-termination invariants (Hoare, 1969)
This sourceIntroduces Hoare logic with precondition/postcondition assertions as the formal framework for proving partial correctness (and, with termination, total correctness) of programs
- The correctness-and-termination invariants (Hoare, 1969)
- Ceteris Paribus
- And in legal and mathematical reasoning it is the scoped statement — "in cases where X holds, the rule provides Y" or "for any continuous function f" — in which the held-fixed condition is the hypothesis.
This sourceEstablishes precondition/postcondition reasoning, in which a program assertion is licensed only under its stated precondition — the held-fixed hypothesis under which a scoped (conditional) claim is provably correct, the formal analogue of a rule or theorem's hypothesis.
- And in legal and mathematical reasoning it is the scoped statement — "in cases where X holds, the rule provides Y" or "for any continuous function f" — in which the held-fixed condition is the hypothesis.
- Constraint
- … convex constraints and the duality between feasible sets and supporting hyperplanes; Montanari's 1974 formalization and Mackworth's 1977 arc-consistency algorithms founded constraint-satisfaction as a distinct computer-science subfield; Floyd's 1967 "Assigning Meanings to Programs" and Hoare's 1969 axiomatic semantics
This sourceFoundational paper introducing Hoare logic with pre/post-condition triples as the formal framework for proving partial correctness and termination invariants of algorithms.
- … convex constraints and the duality between feasible sets and supporting hyperplanes; Montanari's 1974 formalization and Mackworth's 1977 arc-consistency algorithms founded constraint-satisfaction as a distinct computer-science subfield; Floyd's 1967 "Assigning Meanings to Programs" and Hoare's 1969 axiomatic semantics
- Epistemic Mode Of A Proposition
- An
assert(x > 0)places the proposition "x > 0" in assert-mode: it must be checked, and the operation it licenses is "verify, and fail if false."This sourceIntroduces preconditions, postconditions, and loop invariants (Hoare logic), the formal apparatus distinguishing assertions checked from assumptions relied upon and invariants maintained.
- An
- Invariance
- … is the mechanism by which symmetries generate conservation laws (Noether's theorem gives the continuous-group version — each continuous symmetry of the action corresponds to a conserved quantity), topological invariants (genus, Euler characteristic, homotopy class) classify spaces up to deformation, loop invariants
This sourceFoundational paper introducing Hoare logic with pre/post-condition triples as the formal framework for proving partial correctness and termination invariants of algorithms.
- … is the mechanism by which symmetries generate conservation laws (Noether's theorem gives the continuous-group version — each continuous symmetry of the action corresponds to a conserved quantity), topological invariants (genus, Euler characteristic, homotopy class) classify spaces up to deformation, loop invariants
- Iteration
- The loop-invariant for correctness reasoning
This sourceFoundational paper introducing Hoare logic with pre/post-condition triples as the formal framework for proving partial correctness and termination invariants of algorithms.
- The loop-invariant for correctness reasoning
Domain-specific¶
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:da4ab286cea9 · see in the full table