Axiomatic approach to total correctness of programs

DOI10.1007/BF00288637MaRDI QIDQ2561482zbMATH OpenWikidataFDO

Authors Zohar Manna, Amir Pnueli

Publication date 1974

Published in Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cites work

• An axiomatic basis for computer programming
• Automatic program verification. I: A logical basis and its implementation
• Proof of a program

Cited in

(11)

• Interprocedural shape analysis using separation logic-based transformer summaries
• Verifying programs with logic and extended proof rules: deep embedding vs. shallow embedding
• Axiomatic proofs of total correctness of programs
• An axiomatic basis for proving total correctness of goto-programs
• Fair termination revisited - with delay
• On proving the termination of algorithms by machine
• Fifty years of Hoare's logic
• Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
• On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics
• Current methods for proving program correctness
• Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic

Describes a project that uses

Uses Software

• Find

This page was built for publication: Axiomatic approach to total correctness of programs

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