Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes

DOI10.1137/0209050MaRDI QIDQ3891741zbMATH OpenOpenAlexFDO

Authors Krzysztof R. Apt, Lambert Meertens

Publication date 1980

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/10266

zbMATH Keywords

extended state spaceintermediate assertionspartial correctnessrecursive program schemesrelational framework

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Cited in

(3)

• Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II
• Recursive assertions are not enough - or are they?
• On the notion of expressiveness and the rule of adaptation

This page was built for publication: Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes

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