Partial correctness: The term-wise approach

DOI10.1016/0167-6423(84)90017-0MaRDI QIDQ793507zbMATH OpenOpenAlexFDO

Authors Stefan Sokołowski

Publication date 1984

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(84)90017-0

zbMATH Keywords

completenesssoundnessapplicative featuresHoare's logicterm-wise correctness

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 3900131
• Some general incompleteness results for partial correctness logics
• General correctness: A unification of partial and total correctness
• Two theorems about the completeness of Hoare's logic
• Effective Axiomatizations of Hoare Logics

Cited in

(6)

• scientific article; zbMATH DE number 3900131 (Why is no real title available?)
• An elementary and unified approach to program correctness
• General correctness: A unification of partial and total correctness
• Mechanical verification of mutually recursive procedures
• Secure mechanical verification of mutually recursive procedures
• An Analysis of Total Correctness Refinement Models for Partial Relation Semantics II

This page was built for publication: Partial correctness: The term-wise approach

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