Calculating sharp adaptation rules.

DOI10.1016/S0020-0190(00)00215-5MaRDI QIDQ1607103zbMATH OpenWikidataFDO

Authors 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)

Recommendations

• A sharp proof rule for procedures in WP semantics
• Calculating with procedure calls
• Proof rules for recursive procedures
• Safety and progress of recursive procedures
• A general proof rule for procedures in predicate transformer semantics

Cites work

• scientific article; zbMATH DE number 605806 (Why is no real title available?)
• scientific article; zbMATH DE number 3351184 (Why is no real title available?)
• A categorical model for higher order imperative programming
• A sharp proof rule for procedures in WP semantics
• Algebraic proofs of consistency and completeness
• An algebraic construction of predicate transformers
• An axiomatic basis for computer programming
• Assignment and Procedure Call Proof Rules
• Calculating with procedure calls
• Hoare logic and auxiliary variables
• Proving total correctness of recursive procedures
• Refinement Calculus
• Ten Years of Hoare's Logic: A Survey—Part I

Cited in

(4)

• A sharp proof rule for procedures in WP semantics
• Algebraic Methodology and Software Technology
• An adaptation-complete proof system for local reasoning about cloud storage systems
• A proof outline logic for object-oriented programming

This page was built for publication: Calculating sharp adaptation rules.

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