Kleene Algebra with Tests: Completeness and Decidability (1996)

by Dexter Kozen , Frederick Smith
Venue:Proc. 10th Int. Workshop Computer Science Logic (CSL'96), volume 1258 of Lecture Notes in Computer Science
Citations:22 - 11 self

Active Bibliography

10 On the Complexity of Reasoning in Kleene Algebra – Dexter Kozen - 1997
speci cation techniques � F.3.2 [Logics and Meanings of Programs]: Semantics of Programming – Dexter Kozen
32 Certification of compiler optimizations using Kleene algebra with tests – Dexter Kozen, Maria-Cristina Patron - 2000
17 Dynamic Algebras: Examples, Constructions, Applications – Vaughan Pratt - 1991
10 On Action Algebras – Dexter Kozen - 1993
On Action Algebras – Dexter Kozeny - 1993
188 A completeness theorem for Kleene algebras and the algebra of regular events – Dexter Kozen - 1994
3 Myhill-Nerode relations on automatic systems and the completeness of Kleene algebra – Dexter Kozen
16 Typed Kleene algebra – Dexter Kozen - 1998
15 Kleene algebra with tests and program schematology – Allegra Angus, Dexter Kozen - 2001
51 Action Logic and Pure Induction – Vaughan Pratt - 1991
35 Dynamic Algebras as a well-behaved fragment of Relation Algebras – Vaughan Pratt - 1990
42 On Kleene Algebras and Closed Semirings – Dexter Kozen - 1990
4 Equational axioms of test algebra – Marco Hollenberg - 1997
40 On Hoare Logic and Kleene Algebra with Tests – Dexter Kozen
108 Kleene algebra with tests – Dexter Kozen - 1997
1 Kleene Algebras, Rewriting Modulo AC, and Circuits In Coq – Thomas Braibant - 2012
On Kleene Algebras and Closed Semirings – Dexter Kozen Y - 1990
6 On the elimination of hypotheses in Kleene algebra with tests – Chris Hardin, Dexter Kozen - 2002