On the design of program logics

DOI10.1007/978-3-032-13711-1_6MaRDI QIDQ7285341zbMATH OpenFDO

Authors Patrick Cousot

Publication date 19 June 2026

Full work available at URL https://doi.org/10.1007/978-3-032-13711-1_6

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A lattice-theoretical fixpoint theorem and its applications
• An axiomatic basis for computer programming
• Constructive versions of Tarski's fixed point theorems
• Corrigendum: Soundness and Completeness of an Axiom System for Program Verification
• scientific article; zbMATH DE number 4035108 (Why is no real title available?)
• scientific article; zbMATH DE number 3206304 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• scientific article; zbMATH DE number 3349291 (Why is no real title available?)
• On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics
• Principles of abstract interpretation
• Programming and symbolic computation in Maude
• Reverse Hoare logic
• Soundness and Completeness of an Axiom System for Program Verification

This page was built for publication: On the design of program logics

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