Specifications, programs, and total correctness

DOI10.1016/S0167-6423(98)00027-6zbMATH Open0939.68074MaRDI QIDQ1806131FDOQ1806131

Authors: Eric C. R. Hehner 

Publication date: 1 November 1999

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

Recommendations

• A partial correctness proof for programs with decided specification
• Formal models of stepwise refinements of programs
• scientific article; zbMATH DE number 2052653
• A language of specified programs
• General correctness: A unification of partial and total correctness

zbMATH Keywords

total correctness

Mathematics Subject Classification ID

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

Cited In (6)

• Proving correctness w.r.t. specifications with hidden parts
• A fixpoint theory for non-monotonic parallelism
• Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
• Holistic Specifications for Robust Programs
• Junctive compositions of specifications in total and general correctness
• Correctness, explanation and intention

This page was built for publication: Specifications, programs, and total correctness

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