On relative completeness of Hoare logics

DOI10.1016/S0019-9958(85)80010-3zbMath0586.68027MaRDI QIDQ3711743

Michał Grabowski

Publication date: 1985

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

decidabilitypartial correctness assertionsfinite interpretationshalting propertyLipton's theorem

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25)

Related Items (3)

Completeness of Hoare Logic Relative to the Standard Model ⋮ On the status of proving program properties in effective interpretations ⋮ Reasoning about procedures as parameters in the language L4

This page was built for publication: On relative completeness of Hoare logics