Kleene algebra with tests (1997)

by Dexter Kozen
Venue:Transactions on Programming Languages and Systems
Citations:107 - 22 self

Documents Related by Co-Citation

188 A completeness theorem for Kleene algebras and the algebra of regular events – Dexter Kozen - 1994
279 Regular Algebra and Finite Machines – J H Conway - 1971
379 Representation of events in nerve nets and finite automata – S C Kleene - 1956
40 On Hoare Logic and Kleene Algebra with Tests – Dexter Kozen
22 Kleene algebra with tests: Completeness and decidability – Dexter Kozen, Frederick Smith - 1996
365 Propositional dynamic logic of regular programs – M J Fischer, R E Ladner - 1979
18 A semiring on convex polygons and zero-sum cycle problems – K Iwano, K Steiglitz - 1990
16 Using Kleene algebra to reason about concurrency control – Ernie Cohen - 1994
2452 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
23 On induction vs. *-continuity – Dexter Kozen - 1981
27 Representation of events in nerve nets and nite automata, in: C.E – S C Kleene - 1956
39 Separation and Reduction – E Cohen - 2000
825 Dynamic Logic – David Harel, Dexter Kozen, Jerzy Tiuryn - 1984
26 The Kleene and Parikh theorem in complete semirings – W Kuich
134 The Design and Analysis of Algorithms – D KOZEN - 1992
32 Certification of compiler optimizations using Kleene algebra with tests – Dexter Kozen, Maria-Cristina Patron - 2000
35 Dynamic Algebras as a well-behaved fragment of Relation Algebras – Vaughan Pratt - 1990
30 Relation Algebras with Transitive Closure – K C Ng - 1984
16 Galois Connections Presented Calculationally. – C.J. Aarts, Supervisor Roland Backhouse - 1992