A completeness theorem for dynamic logic

DOI10.1305/ndjfl/1093870760zbMath0555.68012OpenAlexW2001982768MaRDI QIDQ760793

László Csirmaz

Publication date: 1985

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093870760

zbMATH Keywords

partial correctnessFloyd-Hoare methodinductive assertions

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Related Items (4)

Recursive programs and denotational semantics in absolute logics of programs ⋮ Weak second order characterizations of various program verification systems ⋮ Total correctness in nonstandard logics of programs ⋮ On the strength of temporal proofs

This page was built for publication: A completeness theorem for dynamic logic