Dijkstra weakest precondition calculus

E459519

Dijkstra weakest precondition calculus is a formal method for reasoning about program correctness by computing the weakest conditions that must hold before execution to guarantee a desired postcondition.

Jump to: Statements Referenced by

Statements (48)

Predicate Object
instanceOf Hoare-style program logic
formal method
predicate transformer calculus
program verification method
appliesTo imperative programs
sequential programs
assumes deterministic program semantics by default
basedOn mathematical logic
predicate logic
contrastsWith strongest postcondition calculus
coreConcept partial correctness
predicate transformer
total correctness
weakest precondition
creator Edsger W. Dijkstra NERFINISHED
defines weakest precondition operator wp
extension weakest liberal precondition calculus
field computer science
goal compute weakest condition before execution that guarantees a postcondition
hasRuleFor assignment statement
conditional statement
loop statement
nondeterministic choice
sequential composition
influenced formal methods in software engineering
refinement calculus
verification condition generation
introducedInWork A Discipline of Programming NERFINISHED
property compositional
sound with respect to operational semantics
supports derivation of loop invariants
syntax-directed
publicationYear 1976
relatedTo Floyd–Hoare logic NERFINISHED
Hoare logic NERFINISHED
program semantics
relatesConcept postcondition
precondition
program specification
program statement
subfield formal verification
program semantics
usedFor deriving correctness proofs
formal program verification
reasoning about program correctness
usedIn program verification tools
static analysis frameworks
theorem provers

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Hoare logic relatedTo Dijkstra weakest precondition calculus