This was an important contribution to what later became Hoare logic.

Use of assertions in program code as first suggested by Hoare logic.

Alternative methods such as Hoare logic and uniqueness have been developed to track side effects in programs.

This property is related to Consequence rule of Hoare logic.

Its simplicity makes proving the correctness of programs easier, using Hoare logic.

It is equivalent to preconditions and postconditions in Hoare logic.

Hoare logic is a specific formal system for reasoning rigorously about the correctness of computer programs.

It is closely related to Hoare logic.

The canonical example of axiomatic semantics is Hoare logic.

The central feature of Hoare logic is the Hoare triple.

Hoare logic provides axioms and inference rules for all the constructs of a simple imperative programming language.

He also developed Hoare logic.

Design by contract has its roots in work on formal verification, formal specification and Hoare logic.

In computer science, separation logic is an extension of Hoare logic, a way of reasoning about programs.

In addition to the standard rules from Hoare logic, separation logic supports the following very important rule:

Using standard Hoare logic, only partial correctness can be proven, while termination needs to be proved separately.

Refinement calculus is a formal system (inspired from Hoare logic) that promotes program refinement.

Logics for processes that allow one to reason about (essentially) arbitrary properties of processes, following the ideas of Hoare logic.

In the meta-theory of Hoare logic, weakest-preconditions appear as a key notion in the proof of relative completeness.

In 1969, Tony Hoare introduces the Hoare logic, a form of axiomatic semantics.

In separation logic, Hoare triples have a slightly different meaning than in Hoare logic.

Specifically, Dijkstra made a "proposal for an introductory programming course for freshmen" that consisted of Hoare logic as an uninterpreted formal system.

Hoare logic, algorithmic logic, weakest preconditions, and dynamic logic are all well suited to discourse and reasoning about sequential behavior.

Refinement calculus, an extension of guarded commands (and Hoare logic) exploiting the lattice structure of predicate transformers (for "refinement" order).

The first generalisation, created with Jeffrey Zucker, focuses on imperative programming with abstract data types and covers specifications and verification using Hoare logic.