ACM Transactions on Programming Languages and Systems (TOPLAS)
On Hoare logic and Kleene algebra with tests
ACM Transactions on Computational Logic (TOCL)
On the complexity of reasoning in Kleene algebra
Information and Computation - Special issue: LICS'97
On the representation of kleene algebras with tests
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
An efficient coq tactic for deciding kleene algebras
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
On the average size of glushkov and equation automata for KAT expressions
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
Kleene algebras with tests provide a natural framework for equational specification and verification. Kleene algebras with tests and related systems have been used successfully in basic safety analysis, source-to-source program transformation, and concurrency control. The equational theory of Kleene algebras with tests has been shown to be decidable in at most exponential time by an efficient reduction to Propositional Dynamic Logic. In this paper we prove that the theory is PSPACE-complete.