A characterization of weakest preconditions

DOI10.1016/S0022-0000(77)80006-8zbMath0369.68004MaRDI QIDQ1243116

Mitchell Wand

Publication date: 1977

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (5)

The weakest precondition calculus: Recursion and duality ⋮ Predicate transformers as power operations ⋮ On the total correctness of nondeterministic programs ⋮ General correctness: A unification of partial and total correctness ⋮ Semantics of algorithmic languages

Cites Work

• Unnamed Item
• Chain-complete posets and directed sets with applications

This page was built for publication: A characterization of weakest preconditions