Corrigendum: Soundness and Completeness of an Axiom System for Program Verification

DOI10.1137/0210045zbMath0466.68015OpenAlexW2049514605WikidataQ114615491 ScholiaQ114615491MaRDI QIDQ3919063

Stephen A. Cook

Publication date: 1981

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0210045

zbMATH Keywords

Hoare style axiom system

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)

Related Items

Automated compositional proofs for real-time systems, On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics, A decision procedure and complete axiomatization for projection temporal logic, Fifty years of Hoare's logic, Hoare's logic for programming languages with two data types, Expressiveness and the completeness of Hoare's logic