A Weakest Precondition Semantics for Z

DOI10.1093/COMJNL/41.1.1MaRDI QIDQ3842954zbMATH OpenOpenAlexFDO

Authors Ana Cavalcanti, Jim Woodcock

Publication date 20 August 1998

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/e9b897389d1bef36521d3d3f023280986b7224aa

zbMATH Keywords

Z specifications

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• ZRC -- A refinement calculus for Z
• scientific article; zbMATH DE number 512961
• scientific article; zbMATH DE number 3974258
• A weakest precondition semantics for communicating processes
• The weakest prespecification

Cited in

(11)

• The weakest prespecification
• ZRC -- A refinement calculus for Z
• Constructive consistency checking for partial specification in Z
• Weakest preconditioned goto axiom
• Weakest relative precondition semantics. Balancing approved theory and realistic translation verification
• From predicates to programs: the semantics of a method language
• Some Variants of the Weakest Precondition in Nondeterminism
• scientific article; zbMATH DE number 8784 (Why is no real title available?)
• scientific article; zbMATH DE number 1487496 (Why is no real title available?)
• scientific article; zbMATH DE number 1424020 (Why is no real title available?)
• Angelic nondeterminism in the unifying theories of programming

This page was built for publication: A Weakest Precondition Semantics for Z

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3842954)