| 2025 | CSL | Classical Linear Logic in Perfect Banach Lattices. | Pedro H. Azevedo de Amorim, Leon Witzman, Dexter Kozen |
| 2024 | IJCAR | A Cyclic Proof System for Guarded Kleene Algebra with Tests. | Jan Rooduijn, Dexter Kozen, Alexandra Silva |
| 2023 | DCC | Abstract Huffman Coding and PIFO Tree Embeddings. | Keri D'Angelo, Dexter Kozen |
| 2023 | ICALP | Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity. | Wojciech Rozowski, Tobias Kapp, Dexter Kozen, Todd Schmid, Alexandra Silva |
| 2022 | ESOP | Concurrent NetKAT - Modeling and analyzing stateful, concurrent networks. | Jana Wagemaker, Nate Foster, Tobias Kapp, Dexter Kozen, Jurriaan Rot, Alexandra Silva |
| 2021 | ICALP | Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness. | Todd Schmid, Tobias Kapp, Dexter Kozen, Alexandra Silva |
| 2021 | LICS | Universal Semantics for the Stochastic λ-Calculus. | Pedro H. Azevedo de Amorim, Dexter Kozen, Radu Mardare, Prakash Panangaden, Michael Roberts |
| 2019 | PLDI | Scalable verification of probabilistic networks. | Steffen Smolka, Praveen Kumar, David M. Kahn, Nate Foster, Justin Hsu, Dexter Kozen, Alexandra Silva |
| 2018 | CSL | The Ackermann Award 2018. | Dexter Kozen, Thomas Schwentick |
| 2018 | LICS | Boolean-Valued Semantics for the Stochastic λ-Calculus. | Giorgio Bacci, Robert Furber, Dexter Kozen, Radu Mardare, Prakash Panangaden, Dana S. Scott |
| 2017 | FOSSACS | Nominal Automata with Name Binding. | Lutz Schrder, Dexter Kozen, Stefan Milius, Thorsten Wimann |
| 2017 | LICS | Unrestricted stone duality for Markov processes. | Robert Furber, Dexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden |
| 2017 | POPL | Cantor meets scott: semantic foundations for probabilistic networks. | Steffen Smolka, Praveen Kumar, Nate Foster, Dexter Kozen, Alexandra Silva |
| 2016 | ESOP | Probabilistic NetKAT. | Nate Foster, Dexter Kozen, Konstantinos Mamouras, Mark Reitblatt, Alexandra Silva |
| 2016 | LICS | Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes. | Dexter Kozen |
| 2015 | CSL | The Ackermann Award 2015. | Anuj Dawar, Dexter Kozen, Simona Ronchi Della Rocca |
| 2015 | ICALP | Nominal Kleene Coalgebra. | Dexter Kozen, Konstantinos Mamouras, Daniela Petrisan, Alexandra Silva |
| 2015 | POPL | A Coalgebraic Decision Procedure for NetKAT. | Nate Foster, Dexter Kozen, Mae Milano, Alexandra Silva, Laure Thompson |
| 2014 | APLAS | NetKAT - A Formal System for the Verification of Networks. | Dexter Kozen |
| 2014 | CSL | KAT + B! | Niels Bjrn Bugge Grathwohl, Dexter Kozen, Konstantinos Mamouras |
| 2014 | CSL | Citations for the test-of-time award from 1994. | Dexter Kozen |
| 2014 | ICALP | Kleene Algebra with Equations. | Dexter Kozen, Konstantinos Mamouras |
| 2014 | POPL | NetkAT: semantic foundations for networks. | Carolyn Jane Anderson, Nate Foster, Arjun Guha, Jean-Baptiste Jeannin, Dexter Kozen, Cole Schlesinger, David Walker |
| 2013 | CSL | Kleene Algebra with Products and Iteration Theories. | Dexter Kozen, Konstantinos Mamouras |
| 2013 | ESOP | Language Constructs for Non-Well-Founded Computation. | Jean-Baptiste Jeannin, Dexter Kozen, Alexandra Silva |
| 2013 | LICS | Stone Duality for Markov Processes. | Dexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden |
| 2013 | MFCS | Strong Completeness for Markovian Logics. | Dexter Kozen, Radu Mardare, Prakash Panangaden |
| 2012 | LICS | Capsules and Separation. | Jean-Baptiste Jeannin, Dexter Kozen |
| 2009 | ICML | Learning prediction suffix trees with Winnow. | Nikolaos Karampatziakis, Dexter Kozen |
| 2008 | LICS | Nonlocal Flow of Control and Kleene Algebra with Tests. | Dexter Kozen |
| 2008 | MPC | The Bhm-Jacopini Theorem Is False, Propositionally. | Dexter Kozen, Wei-Lung Dustin Tseng |
| 2007 | CALCO | Applications of Metric Coinduction. | Dexter Kozen, Nicholas Ruozzi |
| 2006 | CADE | Automating Proofs in Category Theory. | Dexter Kozen, Christoph Kreitz, Eva Richter |
| 2006 | LICS | Coinductive Proof Principles for Stochastic Processes. | Dexter Kozen |
| 2006 | MFCS | On the Representation of Kleene Algebras with Tests. | Dexter Kozen |
| 2006 | MPC | Relational Semantics for Higher-Order Programs. | Kamal Aboul-Hosn, Dexter Kozen |
| 2005 | SIGCSE | Supporting workflow in a course management system. | Chavdar Botev, Hubert Chao, Theodore Chao, Yim Cheng, Raymond Doyle, Sergey Grankin, Jon Guarino, Saikat Guha, Pei-Chen Lee, Dan Perry, Christopher R, Ilya Rifkin, Tingyan Yuan, Dora Abdullah, Kathy Carpenter, David Gries, Dexter Kozen, Andrew C. Myers, David I. Schwartz, Jayavel Shanmugasundaram |
| 2002 | ACSAC | Malicious Code Detection for Open Firmware. | Frank Adelstein, Matthew Stillerman, Dexter Kozen |
| 2002 | MPC | Some Results in Dynamic Model Theory. | Dexter Kozen |
| 2001 | LICS | Intuitionistic Linear Logic and Partial Correctness. | Dexter Kozen, Jerzy Tiuryn |
| 2001 | STACS | Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra. | Dexter Kozen |
| 1999 | LICS | Parikh's Theorem in Commutative Kleene Algebra. | Mark W. Hopkins, Dexter Kozen |
| 1999 | LICS | On Hoare Logic and Kleene Algebra with Tests. | Dexter Kozen |
| 1999 | MFCS | Language-Based Security. | Dexter Kozen |
| 1998 | DCC | Efficient Algorithms for Optimal Video Transmission. | Dexter Kozen, Yaron Minsky, Brian C. Smith |
| 1997 | LICS | On the Complexity of Reasoning in Kleene Algebra. | Dexter Kozen |
| 1996 | CSL | Kleene Algebra with Tests: Completeness and Decidability. | Dexter Kozen, Frederick Smith |
| 1996 | ICALP | A Complete Gentzen-Style Axiomatization for Set Constraints. | Allan Cheng, Dexter Kozen |
| 1996 | LICS | Tarskian Set Constraints. | David A. McAllester, Robert Givan, Carl Witty, Dexter Kozen |
| 1996 | TACAS | Kleene Algebra with Tests and Commutativity Conditions. | Dexter Kozen |
| 1994 | FOCS | Efficient Average-Case Algorithms for the Modular Group | Jin-yi Cai, Wolfgang H. J. Fuchs, Dexter Kozen, Zicheng Liu |
| 1993 | CSL | The Complexity of Set Constraints. | Alexander Aiken, Dexter Kozen, Moshe Y. Vardi, Edward L. Wimmers |
| 1993 | CSL | Logical Aspects of Set Constraints. | Dexter Kozen |
| 1993 | ICALP | Optimal Bounds for the Change-Making Problem. | Dexter Kozen, Shmuel Zaks |
| 1993 | POPL | Efficient Recursive Subtyping. | Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach |
| 1992 | FOCS | Efficient Inference of Partial Types | Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach |
| 1991 | LICS | Rabin Measures and Their Applications to Fairness and Automata Theory | Nils Klarlund, Dexter Kozen |
| 1991 | LICS | A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events | Dexter Kozen |
| 1990 | MFCS | On Kleene Algebras and Closed Semirings. | Dexter Kozen |
| 1987 | FOCS | Functional Decomposition of Polynomials | Joachim von zur Gathen, Dexter Kozen, Susan Landau |
| 1987 | LICS | Definability with Bounded Number of Bound Variables | Neil Immerman, Dexter Kozen |
| 1986 | STOC | A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots | Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari |
| 1985 | FOCS | Algebraic Cell Decomposition in NC (Preliminary Version) | Dexter Kozen, Chee-Keng Yap |
| 1984 | POPL | Generalized Fair Termination. | Nissim Francez, Dexter Kozen |
| 1984 | STOC | The Complexity of Elementary Algebra and Geometry (Preliminary Abstract) | Michael Ben-Or, Dexter Kozen, John H. Reif |
| 1984 | STOC | Pebblings, Edgings, and Equational Logic | Dexter Kozen |
| 1983 | STOC | A Probabilistic PDL | Dexter Kozen |
| 1982 | ICALP | A Programming Language for the Inductive Sets, and Applications. | David Harel, Dexter Kozen |
| 1982 | ICALP | Results on the Propositional µ-Calculus. | Dexter Kozen |
| 1980 | FOCS | Process Logic: Expressiveness, Decidability, Completeness | David Harel, Dexter Kozen, Rohit Parikh |
| 1980 | ICALP | A Representation Theorem for Models of *-Free PDL. | Dexter Kozen |
| 1979 | FCT | Automata and planar graphs. | Dexter Kozen |
| 1979 | FOCS | Semantics of Probabilistic Programs | Dexter Kozen |
| 1978 | FOCS | On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs) | Manuel Blum, Dexter Kozen |
| 1978 | STOC | Indexing of Subrecursive Classes | Dexter Kozen |
| 1977 | FOCS | Lower Bounds for Natural Proof Systems | Dexter Kozen |
| 1977 | STOC | Complexity of Finitely Presented Algebras | Dexter Kozen |
| 1976 | FOCS | On Parallelism in Turing Machines | Dexter Kozen |