Calculating sharp adaptation rules.

DOI10.1016/S0020-0190(00)00215-5zbMath1052.68085WikidataQ127473627 ScholiaQ127473627MaRDI QIDQ1607103

David A. Naumann

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

adaptation rules

Mathematics Subject Classification ID

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

Related Items

An adaptation-complete proof system for local reasoning about cloud storage systems ⋮ A proof outline logic for object-oriented programming

Cites Work

• Unnamed Item
• Unnamed Item
• Algebraic proofs of consistency and completeness
• Calculating with procedure calls
• Proving total correctness of recursive procedures
• A sharp proof rule for procedures in WP semantics
• An algebraic construction of predicate transformers
• Hoare logic and auxiliary variables
• Assignment and Procedure Call Proof Rules
• Ten Years of Hoare's Logic: A Survey—Part I
• A categorical model for higher order imperative programming
• Refinement Calculus
• An axiomatic basis for computer programming