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:21 - 10 self

Documents Related by Co-Citation

108 Kleene algebra with tests – Dexter Kozen - 1997
188 A completeness theorem for Kleene algebras and the algebra of regular events – Dexter Kozen - 1994
40 On Hoare Logic and Kleene Algebra with Tests – Dexter Kozen
279 Regular Algebra and Finite Machines – J H Conway - 1971
379 Representation of events in nerve nets and finite automata – S C Kleene - 1956
365 Propositional dynamic logic of regular programs – M J Fischer, R E Ladner - 1979
15 Automata on guarded strings and applications – Dexter Kozen - 2001
35 Dynamic Algebras as a well-behaved fragment of Relation Algebras – Vaughan Pratt - 1990
825 Dynamic Logic – David Harel, Dexter Kozen, Jerzy Tiuryn - 1984
16 Typed Kleene algebra – Dexter Kozen - 1998
30 Relation Algebras with Transitive Closure – K C Ng - 1984
2452 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
27 Representation of events in nerve nets and nite automata, in: C.E – S C Kleene - 1956
32 Certification of compiler optimizations using Kleene algebra with tests – Dexter Kozen, Maria-Cristina Patron - 2000
16 Using Kleene algebra to reason about concurrency control – Ernie Cohen - 1994
51 Action Logic and Pure Induction – Vaughan Pratt - 1991
9 Regular expressions and the equivalence of programs – D M Kaplan - 1969
5 Automatic proof generation in Kleene algebra – J Worthington - 2008
26 The Kleene and Parikh theorem in complete semirings – W Kuich