Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes

DOI10.1137/0209050zbMath0446.68009OpenAlexW2003003800MaRDI QIDQ3891741

Lambert Meertens, Krzysztof R. Apt

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

recursive program schemespartial correctnessextended state spacerelational frameworkintermediate assertions

Mathematics Subject Classification ID

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

Related Items (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