Recursive assertions are not enough - or are they?

DOI10.1016/0304-3975(79)90058-6zbMath0393.68016OpenAlexW2161992694MaRDI QIDQ1252031

Lambert Meertens, Krzysztof R. Apt, Jan 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)

Related Items (4)

Some general incompleteness results for partial correctness logics ⋮ Recursive assertions and parallel programs ⋮ 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

Cites Work

• On the completeness of the inductive assertion method
• Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes
• A New Incompleteness Result for Hoare's System
• Soundness and Completeness of an Axiom System for Program Verification
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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