Axiomatic approach to total correctness of programs

DOI10.1007/BF00288637zbMATH Open0263.68009WikidataQ56235455 ScholiaQ56235455MaRDI QIDQ2561482FDOQ2561482

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)

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

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)