Recursive assertions are not enough - or are they?

DOI10.1016/0304-3975(79)90058-6MaRDI QIDQ1252031zbMATH OpenOpenAlexFDO

Authors Lambert Meertens, Krzysztof R. Apt, J. A. Bergstra

Publication date 1979

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/12711

zbMATH Keywords

Recursive AssertionsWhile Programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3569793 (Why is no real title available?)
• scientific article; zbMATH DE number 3448070 (Why is no real title available?)
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• A New Incompleteness Result for Hoare's System
• An axiomatic basis for computer programming
• Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes
• On the completeness of the inductive assertion method
• Soundness and Completeness of an Axiom System for Program Verification

Cited in

(4)

• Recursive assertions and parallel programs
• Some general incompleteness results for partial correctness logics
• Completeness of Hoare logic relative to the standard model
• Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs

This page was built for publication: Recursive assertions are not enough - or are they?

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