On Hoare logic and Kleene algebra with tests
ACM Transactions on Computational Logic · 2000-07 · 1 (1) · 60-76
DOI: 10.1145/343369.343378 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Computational Logic, 2000-07. Verfasst von Dexter Kozen. Die Arbeit wurde bisher 112-mal zitiert (Crossref) und nennt 21 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
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
Vancouver
Kozen D. On Hoare logic and Kleene algebra with tests. ACM Transactions on Computational Logic. 2000;1(1):60-76. doi:10.1145/343369.343378
BibTeX
@article{Kozen2000,
author = {Kozen, Dexter},
title = {On Hoare logic and Kleene algebra with tests},
journal = {ACM Transactions on Computational Logic},
year = {2000},
volume = {1},
number = {1},
pages = {60--76},
doi = {10.1145/343369.343378}
}
EUVIMED