BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
algebra (18)
theorem (15)
languag (8)
test (5)
automata (5)

Stem kleen$ (all stems)

40 papers:

CIAACIAA-2015-BrodaCFM #algebra
Deciding Synchronous Kleene Algebra with Derivatives (SB, SC, MF, NM), pp. 49–62.
DLTDLT-2015-EsikFL #algebra
*-Continuous Kleene ω-Algebras (, UF, AL), pp. 240–251.
ICALPICALP-v2-2015-KozenMP0 #algebra
Nominal Kleene Coalgebra (DK, KM, DP, AS), pp. 286–298.
POPLPOPL-2015-Pous #algebra #algorithm #equivalence #testing
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests (DP), pp. 357–368.
LICSLICS-2015-BrunetP #automaton #petri net
Petri Automata for Kleene Allegories (PB, DP), pp. 68–79.
CIAACIAA-2014-JiraskovaPS
Kleene Closure on Regular and Prefix-Free Languages (GJ, MP, JS), pp. 226–237.
ICALPICALP-v2-2014-KozenM #algebra #equation
Kleene Algebra with Equations (DK, KM), pp. 280–292.
LOPSTRLOPSTR-2014-Danilenko #functional
Functional Kleene Closures (ND), pp. 241–258.
QAPLQAPL-2013-McIverRS #algebra #concurrent #probability
Probabilistic Concurrent Kleene Algebra (AM, TMR, GS), pp. 97–115.
CSLCSL-2013-KozenM #algebra
Kleene Algebra with Products and Iteration Theories (DK, KM), pp. 415–431.
DLTDLT-J-2009-GazdagN11 #theorem
A Kleene Theorem for Bisemigroup and binoid Languages (ZG, ZLN), pp. 427–446.
DLTDLT-2010-DrosteV #automaton #bound #logic #multi #theorem
Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices (MD, HV), pp. 160–172.
FoSSaCSFoSSaCS-2009-BonsangueRS #algebra #polynomial #theorem
A Kleene Theorem for Polynomial Coalgebras (MMB, JJMMR, AS), pp. 122–136.
LATALATA-2009-Strassburger #theorem
A Kleene Theorem for Forest Languages (LS), pp. 715–727.
CSLCSL-2009-Moschovakis #recursion #theorem
Kleene’s Amazing Second Recursion Theorem (YNM), pp. 24–39.
FoSSaCSFoSSaCS-2008-DrosteQ #automaton #theorem
A Kleene-Schützenberger Theorem for Weighted Timed Automata (MD, KQ), pp. 142–156.
AFLAFL-2008-GazdagN #theorem
A Kleene Theorem for Binoid Languages (ZG, ZLN), pp. 170–182.
AFLAFL-2008-Pallo
Kleene revisited by Suschkewitsch (JMP), pp. 337–348.
LICSLICS-2008-Kozen #algebra #testing
Nonlocal Flow of Control and Kleene Algebra with Tests (DK), pp. 105–117.
CADECADE-2007-HofnerS #algebra #automation #reasoning
Automated Reasoning in Kleene Algebra (PH, GS), pp. 279–294.
DLTDLT-J-2005-BesC06 #linear #order #theorem #word
A Kleene Theorem for Languages of Words Indexed by Linear Orderings (AB, OC), pp. 519–542.
DLTDLT-2005-BesC #linear #order #theorem #word
A Kleene Theorem for Languages of Words Indexed by Linear Orderings (AB, OC), pp. 158–167.
LICSLICS-2005-Hardin #algebra #proving
Proof Theory for Kleene Algebra (CH), pp. 290–299.
DLTDLT-2004-GenestMK #algorithm #automaton #communication #effectiveness #theorem
A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms (BG, AM, DK), pp. 30–48.
LOPSTRLOPSTR-2002-GutierrezR #calculus #type system #verification
A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene (FG, BCR), pp. 17–31.
ESOPESOP-2000-NielsonNS #analysis #mobile
A Kleene Analysis of Mobile Ambients (FN, HRN, SS), pp. 305–319.
ICLPCL-2000-KozenP #algebra #certification #compilation #optimisation #testing #using
Certification of Compiler Optimizations Using Kleene Algebra with Tests (DK, MCP), pp. 568–582.
LICSLICS-1999-HopkinsK #algebra #commutative #theorem
Parikh’s Theorem in Commutative Kleene Algebra (MWH, DK), pp. 394–401.
LICSLICS-1999-Kozen #algebra #hoare #logic #on the #testing
On Hoare Logic and Kleene Algebra with Tests (DK), pp. 167–172.
LICSLICS-1997-AsarinCM #automaton #theorem
A Kleene Theorem for Timed Automata (EA, PC, OM), pp. 160–171.
LICSLICS-1997-Kozen #algebra #complexity #on the #reasoning
On the Complexity of Reasoning in Kleene Algebra (DK), pp. 195–202.
TACASTACAS-1996-Kozen #algebra #commutative
Kleene Algebra withTests and Commutativity Conditions (DK), pp. 14–33.
CSLCSL-1996-KozenS #algebra #decidability #testing
Kleene Algebra with Tests: Completeness and Decidability (DK, FS), pp. 244–259.
CADECADE-1994-KerberK #logic
A Mechanization of Strong Kleene Logic for Partial Functions (MK, MK), pp. 371–385.
CSLCSL-1992-Smith #type system
Kleene’s Slash and Existence of Values of Open Terms in Type Theory (JMS), pp. 395–402.
ICALPICALP-1991-GastinPZ #infinity #theorem
A Kleene Theorem for Infinite Trace Languages (PG, AP, WZ), pp. 254–266.
CSLCSL-1991-Leiss #algebra #recursion #towards
Towards Kleene Algebra with Recursion (HL), pp. 242–256.
LICSLICS-1991-Kozen #algebra #theorem
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events (DK), pp. 214–225.
ICALPICALP-1988-Schafer #approach #linear
A Kleene-Presburgerian Approach to Linear Production Systems (JS), pp. 525–534.
ICALPICALP-1987-Kuich #theorem
The Kleene and the Parikh Theorem in Complete Semirings (WK), pp. 212–225.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.