Proving programs correct through refinement

DOI10.1007/BF00289073MaRDI QIDQ1242447zbMATH OpenFDO

Authors Claus H. Correll

Publication date 1978

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00289073

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cites work

• Abstract data types and software validation
• scientific article; zbMATH DE number 3471564 (Why is no real title available?)
• scientific article; zbMATH DE number 3562496 (Why is no real title available?)
• scientific article; zbMATH DE number 3441608 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• scientific article; zbMATH DE number 3421895 (Why is no real title available?)
• Program development by stepwise refinement
• Proof of correctness of data representations
• Proof techniques for hierarchically structured programs

Cited in

(2)

• On correct refinement of programs
• Specifications, models, and implementations of data abstractions

This page was built for publication: Proving programs correct through refinement

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