Feasibly Reducing KAT Equations to KA Equations
| dc.creator | Worthington, James | |
| dc.date | 2008-01-15 | |
| dc.date.accessioned | 2026-07-07T08:54:39Z | |
| dc.date.available | 2026-07-07T08:54:39Z | |
| dc.description | Kleene algebra (KA) is the algebra of regular events. Familiar examples of Kleene algebras include regular sets, relational algebras, and trace algebras. A Kleene algebra with tests (KAT) is a Kleene algebra with an embedded Boolean subalgebra. The addition of tests allows one to encode {\tt while} programs as KAT terms, thus the equational theory of KAT can express (propositional) program equivalence. More complicated statements about programs can be expressed in the Hoare theory of KAT, which suffices to encode Propositional Hoare Logic. That the equational theory of KAT reduces to the equational theory of KA has been shown by Cohen et al. Unfortunately, their reduction involves an exponential blowup in the size of the terms involved. Here we give an alternate feasible reduction. | |
| dc.identifier | https://arxiv.org/abs/0801.2368 | |
| dc.identifier | http://arxiv.org/abs/0801.2368 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/146012 | |
| dc.subject | Logic | |
| dc.title | Feasibly Reducing KAT Equations to KA Equations | |
| dc.type | text |