A partial correctness proof for programs with decided specification

MaRDI QIDQ5455088zbMATH OpenFDO

Authors

Publication date 3 April 2008

zbMATH Keywords

axiomatic semanticsloop invariant

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• A complete proof for the correctness of programs with new specification language
• scientific article; zbMATH DE number 3888897
• scientific article; zbMATH DE number 3900131
• Proof rules for recursive procedures
• A language of specified programs

Cited in

(7)

• Specifications, programs, and total correctness
• Is ``Some-other-time sometimes better than ``Sometime for proving partial correctness of programs?
• scientific article; zbMATH DE number 3888897 (Why is no real title available?)
• Proof of Correctness of Decision Table Programs
• A complete proof for the correctness of programs with new specification language
• Proving correctness w.r.t. specifications with hidden parts
• scientific article; zbMATH DE number 3892562 (Why is no real title available?)

This page was built for publication: A partial correctness proof for programs with decided specification

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