Computer science Semantics and logic in computer science Concept
Hoare logic
Builds on Predicate logicOperational semantics
Summary
Hoare logic is a formal system for proving that imperative programs are correct. C. A. R. Hoare introduced it in 1969, building on earlier work of Robert W. Floyd. Its statements are Hoare triples : if the precondition holds before the command runs and terminates, then the postcondition holds afterwards. It has one axiom or rule for each construct of the language, so a proof follows the structure of the program. It is sound for the operational semantics of the language, and it is the ancestor of most program verification methods.
Reading path
To understand this page from the ground up, read these 12 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Binary relation concept
- Proposition concept
- Operational semantics concept
- Conjunction definition
- Disjunction definition
- Implication definition
- Negation definition
- Predicate definition
- Biconditional definition
- Propositional logic concept
- Predicate logic concept
- Hoare logic concept
Where this leads
4 pages build on this one.
Further reading
About this page
| Tag | H1M6RSBJ5H |
|---|---|
| URI | m2://H1M6RSBJ5H |
| Kind | concept |
| Writing | W0 stub |
| MSC | 68Q60, 03B70 |
| Uses | Predicate logic, Operational semantics |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.