Construct · 1 fields · 1 citations

Hoare logic: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computer science

a formal system for proving program correctness using triples of a precondition, a command and a postcondition.

In computer science, Hoare logic refers to a formal system for proving program correctness using triples of a precondition, a command and a postcondition. This meaning comes from Hoare (1969) in Communications of the ACM.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Hoare logic sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

invariance4 fields · 5 citationsjingle · one word, four constructs annotation1 fields · 2 citationsanchor · a standalone construct assignment3 fields · 3 citationsjingle · one word, three constructs

References

Hoare, C. A. R. (1969). An axiomatic basis for computer programming. Communications of the ACM, 12(10), 576-580. https://doi.org/10.1145/363235.363259

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct