Abstract
We show that Kleene algebra with tests (KAT) subsumes propositional Hoare logic (PHL). Thus the specialized syntax and deductive apparatus of Hoare logic are inessential and can be replaced by simple equational reasoning. In addition, we show that all relationally valid inference rules are derivable in KAT and that deciding the relational validity of such rules is PSPACE-complete. © 2000, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Kozen, D. (2000). On Hoare Logic and Kleene Algebra with Tests. ACM Transactions on Computational Logic, 1(1), 60–76. https://doi.org/10.1145/343369.343378
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free