BibSLEIGH — Dexter

Travelled to:

1 × Austria
1 × Canada
1 × Croatia
1 × India
1 × Japan
1 × Poland
1 × Sweden
15 × USA
2 × Denmark
2 × Germany
2 × The Netherlands
2 × United Kingdom
3 × Italy

Collaborated with:

∅ K.Mamouras N.Foster J.Jeannin A.Silva A.S.0001 M.Ben-Or S.Smolka N.Karampatziakis J.Tiuryn M.Patron M.W.Hopkins F.Smith A.Cheng S.Zaks N.Klarlund N.Immerman N.Francez D.Harel T.Schwentick F.Dahlqvist Praveen Kumar 0003 N.B.B.Grathwohl C.Kreitz E.Richter J.Palsberg M.I.Schwartzbach J.H.Reif J.Hsu D.Petrisan K.G.Larsen R.Mardare P.Panangaden D.A.McAllester R.Givan C.Witty A.Aiken M.Y.Vardi E.L.Wimmers E.Feig P.Tiwari M.Milano L.Thompson M.Reitblatt T.Kappé C.J.Anderson A.Guha C.Schlesinger D.Walker David M. Kahn

Talks about:

algebra (14) kleen (12) set (7) constraint (6) probabilist (5) test (5) complex (4) logic (4) theorem (3) program (3)

Person: Dexter Kozen

DBLP: Kozen:Dexter

Contributed to:

2015

2014

2013

2012

2009

2008

2006

2001

2000

1999

1997

1996

1993

1991

1987

1986

1984

1983

1982

1980

1978

1977

1995

1996

2016

2018

2017

2019

2020

Wrote 47 papers:

ICALP-v2-2015-KozenMP0 #algebra: Nominal Kleene Coalgebra (DK, KM, DP, AS), pp. 286–298.
POPL-2015-FosterKM0T #algebra: A Coalgebraic Decision Procedure for NetKAT (NF, DK, MM, AS, LT), pp. 343–355.
ICALP-v2-2014-KozenM #algebra #equation: Kleene Algebra with Equations (DK, KM), pp. 280–292.
LICS-CSL-2014-GrathwohlKM #exclamation: KAT + B! (NBBG, DK, KM), p. 10.
POPL-2014-AndersonFGJKSW #named #network #semantics: NetkAT: semantic foundations for networks (CJA, NF, AG, JBJ, DK, CS, DW), pp. 113–126.
CSL-2013-KozenM #algebra: Kleene Algebra with Products and Iteration Theories (DK, KM), pp. 415–431.
ESOP-2013-JeanninKS: Language Constructs for Non-Well-Founded Computation (JBJ, DK, AS), pp. 61–80.
LICS-2013-KozenLMP #markov #process: Stone Duality for Markov Processes (DK, KGL, RM, PP), pp. 321–330.
LICS-2012-JeanninK: Capsules and Separation (JBJ, DK), pp. 425–430.
ICML-2009-KarampatziakisK #learning #predict: Learning prediction suffix trees with Winnow (NK, DK), pp. 489–496.
LICS-2008-Kozen #algebra #testing: Nonlocal Flow of Control and Kleene Algebra with Tests (DK), pp. 105–117.
IJCAR-2006-KozenKR #automation #category theory #proving: Automating Proofs in Category Theory (DK, CK, ER), pp. 392–407.
LICS-2006-Kozen #induction #probability #process #proving: Coinductive Proof Principles for Stochastic Processes (DK), pp. 359–366.
LICS-2001-KozenT #correctness #linear #logic: Intuitionistic Linear Logic and Partial Correctness (DK, JT), pp. 259–268.
CL-2000-KozenP #algebra #certification #compilation #optimisation #testing #using: Certification of Compiler Optimizations Using Kleene Algebra with Tests (DK, MCP), pp. 568–582.
LICS-1999-HopkinsK #algebra #commutative #theorem: Parikh’s Theorem in Commutative Kleene Algebra (MWH, DK), pp. 394–401.
LICS-1999-Kozen #algebra #hoare #logic #on the #testing: On Hoare Logic and Kleene Algebra with Tests (DK), pp. 167–172.
LICS-1997-Kozen #algebra #complexity #on the #reasoning: On the Complexity of Reasoning in Kleene Algebra (DK), pp. 195–202.
CSL-1996-KozenS #algebra #decidability #testing: Kleene Algebra with Tests: Completeness and Decidability (DK, FS), pp. 244–259.
ICALP-1996-ChengK #axiom #constraints #set: A Complete Gentzen-Style Axiomatization for Set Constraints (AC, DK), pp. 134–145.
LICS-1996-McAllesterGWK #constraints #set: Tarskian Set Constraints (DAM, RG, CW, DK), pp. 138–147.
TACAS-1996-Kozen #algebra #commutative: Kleene Algebra withTests and Commutativity Conditions (DK), pp. 14–33.
CSL-1993-AikenKVW #complexity #constraints #set: The Complexity of Set Constraints (AA, DK, MYV, ELW), pp. 1–17.
CSL-1993-Kozen #aspect-oriented #constraints #logic #set: Logical Aspects of Set Constraints (DK), pp. 175–188.
ICALP-1993-KozenZ #bound #problem: Optimal Bounds for the Change-Making Problem (DK, SZ), pp. 150–161.
POPL-1993-KozenPS #performance #recursion #type system: Efficient Recursive Subtyping (DK, JP, MIS), pp. 419–428.
LICS-1991-KlarlundK #automaton #metric: Rabin Measures and Their Applications to Fairness and Automata Theory (NK, DK), pp. 256–265.
LICS-1991-Kozen #algebra #theorem: A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events (DK), pp. 214–225.
LICS-1987-ImmermanK #bound: Definability with Bounded Number of Bound Variables (NI, DK), pp. 236–244.
STOC-1986-Ben-OrFKT #algorithm #parallel #performance #polynomial: A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots (MBO, EF, DK, PT), pp. 340–349.
POPL-1984-FrancezK #termination: Generalized Fair Termination (NF, DK), pp. 46–53.
STOC-1984-Ben-OrKR #algebra #complexity #geometry: The Complexity of Elementary Algebra and Geometry (MBO, DK, JHR), pp. 457–464.
STOC-1984-Kozen #equation #logic: Pebblings, Edgings, and Equational Logic (DK), pp. 428–435.
STOC-1983-Kozen #probability: A Probabilistic PDL (DK), pp. 291–297.
ICALP-1982-HarelK #induction #programming language #set: A Programming Language for the Inductive Sets, and Applications (DH, DK), pp. 313–329.
ICALP-1982-Kozen #calculus #μ-calculus: Results on the Propositional μ-Calculus (DK), pp. 348–359.
ICALP-1980-Kozen #modelling #representation #theorem: A Representation Theorem for Models of *-Free PDL (DK), pp. 351–362.
STOC-1978-Kozen #recursion: Indexing of Subrecursive Classes (DK), pp. 287–295.
STOC-1977-Kozen #algebra #complexity: Complexity of Finitely Presented Algebras (DK), pp. 164–177.
TAPSOFT-1995-Kozen #constraints #set: Rational Spaces and Set Constraints (DK), pp. 42–61.
TAPSOFT-J-1995-Kozen96 #constraints #set: Rational Spaces and Set Constraints (DK), pp. 73–94.
ESOP-2016-FosterKMR0 #probability: Probabilistic NetKAT (NF, DK, KM, MR, AS0), pp. 282–309.
CSL-2018-KozenS: The Ackermann Award 2018 (DK, TS), p. 5.
POPL-2017-SmolkaKFK0 #network #probability #semantics: Cantor meets scott: semantic foundations for probabilistic networks (SS, PK0, NF, DK, AS0), pp. 557–571.
PLDI-2019-SmolkaKKFHK0 #network #probability #scalability #verification: Scalable verification of probabilistic networks (SS, PK0, DMK, NF, JH, DK, AS0), pp. 190–203.
POPL-2020-DahlqvistK #higher-order #probability #semantics #source code: Semantics of higher-order probabilistic programs with conditioning (FD, DK), p. 29.
POPL-2020-SmolkaFHKKS #algebra #linear #source code #testing #verification: Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time (SS, NF, JH, TK, DK, AS0), p. 28.