A note on the complexity of propositional Hoare logic

DOI10.1145/343369.343404zbMath1365.68321OpenAlexW2027983931MaRDI QIDQ5738904

Ernie Cohen, Dexter Kozen

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/343369.343404

zbMATH Keywords

specificationHoare logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes ⋮ Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism

This page was built for publication: A note on the complexity of propositional Hoare logic