On Hoare Logic and Kleene Algebra with Tests

Authors:
Dexter Kozen
Affiliations:
-
Venue:
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Year:
1999

Citing 0
Cited 5

A coalgebraic approach to Kleene algebra with tests

Theoretical Computer Science - Selected papers of CMCS'03
Conceptual modelling of web information systems

Data & Knowledge Engineering
Personalisation of web information systems - A term rewriting approach

Data & Knowledge Engineering
Customising Web Information Systems According to User Preferences

World Wide Web
Term rewriting for web information systems: termination and church-rosser property

WISE'07 Proceedings of the 8th international conference on Web information systems engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that Kleene algebra with tests subsumes propositional Hoare logic. Thus the specialized syntax and deductive apparatus of Hoare logic are inessential and can be replaced by ordinary equational reasoning. It follows from the reduction that propositional Hoare logic is in PSPACE; we show that it is PSPACE-complete.