Dexter Kozen - RankMe

210 papers A* 45A 8B 27C 4Journal 94Unranked 26

Year	Rank	Type	Title / Venue / Authors
2026	C	`ed.`	Logic, Language, Information, and Computation - 31st International Workshop, WoLLIC 2025, Porto, Portugal, July 14-17, 2025, Proceedings WoLLIC Dexter Kozen, Ruy J. G. B. de Queiroz
2025	J	`jnl`	31st workshop on logic, language, information, and computation ( Log. J. IGPL Dexter Kozen, Ruy J. G. B. de Queiroz
2025	J	`jnl`	A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism. CoRR Shawn Ong, Dexter Kozen
2025	J	`jnl`	A Demonic Outcome Logic for Randomized Nondeterminism. Proc. ACM Program. Lang. Noam Zilberstein, Dexter Kozen, Alexandra Silva, Joseph Tassarotti
2025	B	`conf`	Classical Linear Logic in Perfect Banach Lattices. CSL Pedro H. Azevedo de Amorim, Leon Witzman, Dexter Kozen
2025	J	`jnl`	Probabilistic Kleene Algebra with Angelic Nondeterminism. Proc. ACM Program. Lang. Shawn Ong, Stephanie Ma, Dexter Kozen
2025	J	`jnl`	StacKAT: Infinite State Network Verification. CoRR Jules Jacobs, Nate Foster, Tobias Kappé, Dexter Kozen, Lily Saada, Alexandra Silva, Jana Wagemaker
2025	J	`jnl`	StacKAT: Infinite State Network Verification. Proc. ACM Program. Lang. Jules Jacobs, Nate Foster, Tobias Kappé, Dexter Kozen, Lily Saada, Alexandra Silva, Jana Wagemaker
2024	—	`conf`	A Cyclic Proof System for Guarded Kleene Algebra with Tests. IJCAR (2) Jan Rooduijn, Dexter Kozen, Alexandra Silva
2024	J	`jnl`	A Demonic Outcome Logic for Randomized Nondeterminism. CoRR Noam Zilberstein, Dexter Kozen, Alexandra Silva, Joseph Tassarotti
2024	J	`jnl`	A cyclic proof system for Guarded Kleene Algebra with Tests (full version). CoRR Jan Rooduijn, Dexter Kozen, Alexandra Silva
2024	—	`conf`	Multisets and Distributions. Logics and Type Systems in Theory and Practice Dexter Kozen, Alexandra Silva
2024	J	`jnl`	Probability and Angelic Nondeterminism with Multiset Semantics. CoRR Shawn Ong, Stephanie Ma, Dexter Kozen
2023	B	`conf`	Abstract Huffman Coding and PIFO Tree Embeddings. DCC Keri D'Angelo, Dexter Kozen
2023	J	`jnl`	Abstract Huffman Coding and PIFO Tree Embeddings. CoRR Keri D'Angelo, Dexter Kozen
2023	J	`jnl`	Formal Abstractions for Packet Scheduling. Proc. ACM Program. Lang. Anshuman Mohan, Yunhe Liu, Nate Foster, Tobias Kappé, Dexter Kozen
2023	B	`conf`	Joint Distributions in Probabilistic Semantics. MFPS Dexter Kozen, Alexandra Silva, Erik Voogd
2023	J	`jnl`	Multisets and Distributions. CoRR Dexter Kozen, Alexandra Silva
2023	A*	`conf`	Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity. ICALP Wojciech Rozowski, Tobias Kappé, Dexter Kozen, Todd Schmid, Alexandra Silva
2023	J	`jnl`	Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity. CoRR Wojciech Rozowski, Tobias Kappé, Dexter Kozen, Todd Schmid, Alexandra Silva
2022	J	`jnl`	2022 Alonzo Church Award Announcement. ACM SIGLOG News Dexter Kozen
2022	J	`jnl`	Coalgebraic tools for randomness-conserving protocols. J. Log. Algebraic Methods Program. Dexter Kozen, Matvey Soloviev
2022	A	`conf`	Concurrent NetKAT - Modeling and analyzing stateful, concurrent networks. ESOP Jana Wagemaker, Nate Foster, Tobias Kappé, Dexter Kozen, Jurriaan Rot, Alexandra Silva
2022	J	`jnl`	Concurrent NetKAT: Modeling and analyzing stateful, concurrent networks. CoRR Jana Wagemaker, Nate Foster, Tobias Kappé, Dexter Kozen, Jurriaan Rot, Alexandra Silva
2022	J	`jnl`	Formal Abstractions for Packet Scheduling. CoRR Anshuman Mohan, Yunhe Liu, Nate Foster, Tobias Kappé, Dexter Kozen
2022	J	`jnl`	Formalizing Moessner's theorem and generalizations in Nuprl. J. Log. Algebraic Methods Program. Mark Bickford, Dexter Kozen, Alexandra Silva
2022	J	`jnl`	Reminiscences of Juris. SIGACT News Dexter Kozen
2021	A*	`conf`	Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness. ICALP Todd Schmid, Tobias Kappé, Dexter Kozen, Alexandra Silva
2021	J	`jnl`	Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness. CoRR Todd Schmid, Tobias Kappé, Dexter Kozen, Alexandra Silva
2021	A*	`conf`	Universal Semantics for the Stochastic λ-Calculus. LICS Pedro H. Azevedo de Amorim, Dexter Kozen, Radu Mardare, Prakash Panangaden, Michael Roberts
2020	J	`jnl`	Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time. Proc. ACM Program. Lang. Steffen Smolka, Nate Foster, Justin Hsu, Tobias Kappé, Dexter Kozen, Alexandra Silva
2020	J	`jnl`	Left-handed completeness. Theor. Comput. Sci. Dexter Kozen, Alexandra Silva
2020	J	`jnl`	Minimisation in Logical Form. CoRR Nick Bezhanishvili, Marcello M. Bonsangue, Helle Hvid Hansen, Dexter Kozen, Clemens Kupke, Prakash Panangaden, Alexandra Silva
2020	—	`ch.`	Semantics of Probabilistic Programming: A Gentle Introduction. Foundations of Probabilistic Programming Fredrik Dahlqvist, Alexandra Silva, Dexter Kozen
2020	J	`jnl`	Semantics of higher-order probabilistic programs with conditioning. Proc. ACM Program. Lang. Fredrik Dahlqvist, Dexter Kozen
2020	J	`jnl`	Universal Semantics for the Stochastic Lambda-Calculus. CoRR Pedro H. Azevedo de Amorim, Dexter Kozen, Radu Mardare, Prakash Panangaden, Michael Roberts
2019	J	`jnl`	Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time. CoRR Steffen Smolka, Nate Foster, Justin Hsu, Tobias Kappé, Dexter Kozen, Alexandra Silva
2019	J	`jnl`	Natural Transformations as Rewrite Rules and Monad Composition. Log. Methods Comput. Sci. Dexter Kozen
2019	J	`jnl`	On Free ω-Continuous and Regular Ordered Algebras. Log. Methods Comput. Sci. Zoltán Ésik, Dexter Kozen
2019	J	`jnl`	Scalable Verification of Probabilistic Networks. CoRR Steffen Smolka, Praveen Kumar, David M. Kahn, Nate Foster, Justin Hsu, Dexter Kozen, Alexandra Silva
2019	A*	`conf`	Scalable verification of probabilistic networks. PLDI Steffen Smolka, Praveen Kumar, David M. Kahn, Nate Foster, Justin Hsu, Dexter Kozen, Alexandra Silva
2019	J	`jnl`	Semantics of higher-order probabilistic programs with conditioning. CoRR Fredrik Dahlqvist, Dexter Kozen
2018	A*	`conf`	Boolean-Valued Semantics for the Stochastic λ-Calculus. LICS Giorgio Bacci, Robert Furber, Dexter Kozen, Radu Mardare, Prakash Panangaden, Dana S. Scott
2018	C	`conf`	Coalgebraic Tools for Randomness-Conserving Protocols. RAMiCS Dexter Kozen, Matvey Soloviev
2018	J	`jnl`	Coalgebraic Tools for Randomness-Conserving Protocols. CoRR Dexter Kozen, Matvey Soloviev
2018	B	`conf`	The Ackermann Award 2018. CSL Dexter Kozen, Thomas Schwentick
2017	A*	`conf`	Cantor meets scott: semantic foundations for probabilistic networks. POPL Steffen Smolka, Praveen Kumar, Nate Foster, Dexter Kozen, Alexandra Silva
2017	J	`jnl`	CoCaml: Functional Programming with Regular Coinductive Types. Fundam. Informaticae Jean-Baptiste Jeannin, Dexter Kozen, Alexandra Silva
2017	J	`jnl`	Completeness and incompleteness in nominal Kleene algebra. J. Log. Algebraic Methods Program. Dexter Kozen, Konstantinos Mamouras, Alexandra Silva
2017	J	`jnl`	Deciding Probabilistic Program Equivalence in NetKAT. CoRR Steffen Smolka, David M. Kahn, Praveen Kumar, Nate Foster, Dexter Kozen, Alexandra Silva
2017	J	`jnl`	Infinitary Axiomatization of the Equational Theory of Context-Free Languages. Fundam. Informaticae Niels Bjørn Bugge Grathwohl, Fritz Henglein, Dexter Kozen
2017	B	`conf`	Nominal Automata with Name Binding. FoSSaCS Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann
2017	J	`jnl`	Practical coinduction. Math. Struct. Comput. Sci. Dexter Kozen, Alexandra Silva
2017	A*	`conf`	Unrestricted stone duality for Markov processes. LICS Robert Furber, Dexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden
2017	J	`jnl`	Well-founded coalgebras, revisited. Math. Struct. Comput. Sci. Jean-Baptiste Jeannin, Dexter Kozen, Alexandra Silva
2016	J	`jnl`	Cantor meets Scott: Domain-Theoretic Foundations for Probabilistic Network Programming. CoRR Steffen Smolka, Praveen Kumar, Nate Foster, Dexter Kozen, Alexandra Silva
2016	A*	`conf`	Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes. LICS Dexter Kozen
2016	J	`jnl`	Natural Transformations as Rewrite Rules and Monad Composition. CoRR Dexter Kozen
2016	J	`jnl`	Nominal Automata with Name Binding. CoRR Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann
2016	J	`jnl`	On Free ω-Continuous and Regular Ordered Algebras. CoRR Zoltán Ésik, Dexter Kozen
2016	A	`conf`	Probabilistic NetKAT. ESOP Nate Foster, Dexter Kozen, Konstantinos Mamouras, Mark Reitblatt, Alexandra Silva
2015	A*	`conf`	A Coalgebraic Decision Procedure for NetKAT. POPL Nate Foster, Dexter Kozen, Mae Milano, Alexandra Silva, Laure Thompson
2015	C	`conf`	Completeness and Incompleteness in Nominal Kleene Algebra. RAMiCS Dexter Kozen, Konstantinos Mamouras, Alexandra Silva
2015	—	`conf`	Nominal Kleene Coalgebra. ICALP (2) Dexter Kozen, Konstantinos Mamouras, Daniela Petrisan, Alexandra Silva
2015	B	`conf`	The Ackermann Award 2015. CSL Anuj Dawar, Dexter Kozen, Simona Ronchi Della Rocca
2014	B	`conf`	A Metrized Duality Theorem for Markov Processes. MFPS Dexter Kozen, Radu Mardare, Prakash Panangaden
2014	—	`conf`	Citations for the test-of-time award from 1994. CSL-LICS Dexter Kozen
2014	—	`conf`	KAT + B! CSL-LICS Niels Bjørn Bugge Grathwohl, Dexter Kozen, Konstantinos Mamouras
2014	—	`conf`	Kleene Algebra with Equations. ICALP (2) Dexter Kozen, Konstantinos Mamouras
2014	B	`conf`	NetKAT - A Formal System for the Verification of Networks. APLAS Dexter Kozen
2014	A*	`conf`	NetkAT: semantic foundations for networks. POPL Carolyn Jane Anderson, Nate Foster, Arjun Guha, Jean-Baptiste Jeannin, Dexter Kozen, Cole Schlesinger, David Walker
2014	—	`conf`	Optimal Coin Flipping. Horizons of the Mind Dexter Kozen
2013	—	`conf`	Infinitary Axiomatization of the Equational Theory of Context-Free Languages. FICS Niels Bjørn Bugge Grathwohl, Fritz Henglein, Dexter Kozen
2013	B	`conf`	Kleene Algebra with Products and Iteration Theories. CSL Dexter Kozen, Konstantinos Mamouras
2013	A	`conf`	Language Constructs for Non-Well-Founded Computation. ESOP Jean-Baptiste Jeannin, Dexter Kozen, Alexandra Silva
2013	J	`jnl`	On Moessner's Theorem. Am. Math. Mon. Dexter Kozen, Alexandra Silva
2013	B	`conf`	Preface. MFPS Dexter Kozen, Michael W. Mislove
2013	B	`ed.`	Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, MFPS 2013, New Orleans, LA, USA, June 23-25, 2013 MFPS Dexter Kozen, Michael W. Mislove
2013	J	`jnl`	Reflection in the Chomsky Hierarchy. J. Autom. Lang. Comb. Henk Barendregt, Venanzio Capretta, Dexter Kozen
2013	A*	`conf`	Stone Duality for Markov Processes. LICS Dexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden
2013	B	`conf`	Strong Completeness for Markovian Logics. MFCS Dexter Kozen, Radu Mardare, Prakash Panangaden
2012	A*	`conf`	Capsules and Separation. LICS Jean-Baptiste Jeannin, Dexter Kozen
2012	—	`conf`	Computing with Capsules. DCFS Jean-Baptiste Jeannin, Dexter Kozen
2012	J	`jnl`	Computing with Capsules. J. Autom. Lang. Comb. Jean-Baptiste Jeannin, Dexter Kozen
2012	C	`conf`	Left-Handed Completeness. RAMiCS Dexter Kozen, Alexandra Silva
2012	B	`conf`	New. MFPS Dexter Kozen
2011	B	`conf`	Realization of Coinductive Types. MFPS Dexter Kozen
2010	J	`jnl`	Church-Rosser Made Easy. Fundam. Informaticae Dexter Kozen
2010	—	`conf`	Halting and Equivalence of Program Schemes in Models of Arbitrary Theories. Fields of Logic and Computation Dexter Kozen
2009	J	`jnl`	Applications of Metric Coinduction Log. Methods Comput. Sci. Dexter Kozen, Nicholas Ruozzi
2009	A*	`conf`	Learning prediction suffix trees with Winnow. ICML Nikolaos Karampatziakis, Dexter Kozen
2008	J	`jnl`	Local variable scoping and Kleene algebra with tests. J. Log. Algebraic Methods Program. Kamal Aboul-Hosn, Dexter Kozen
2008	A*	`conf`	Nonlocal Flow of Control and Kleene Algebra with Tests. LICS Dexter Kozen
2008	B	`conf`	The Böhm-Jacopini Theorem Is False, Propositionally. MPC Dexter Kozen, Wei-Lung Dustin Tseng
2007	B	`conf`	Applications of Metric Coinduction. CALCO Dexter Kozen, Nicholas Ruozzi
2007	J	`jnl`	Coinductive Proof Principles for Stochastic Processes CoRR Dexter Kozen
2007	J	`jnl`	Coinductive Proof Principles for Stochastic Processes. Log. Methods Comput. Sci. Dexter Kozen
2007	—	`conf`	Collective Inference on Markov Models for Modeling Bird Migration. NIPS Daniel Sheldon, M. A. Saleh Elmohamed, Dexter Kozen
2007	J	`jnl`	Preface. Sci. Comput. Program. Dexter Kozen
2006	A	`conf`	Automating Proofs in Category Theory. IJCAR Dexter Kozen, Christoph Kreitz, Eva Richter
2006	A*	`conf`	Coinductive Proof Principles for Stochastic Processes. LICS Dexter Kozen
2006	J	`jnl`	KAT-ML: an interactive theorem prover for Kleene algebra with tests. J. Appl. Non Class. Logics Kamal Aboul-Hosn, Dexter Kozen
2006	—	`conf`	Local Variable Scoping and Kleene Algebra with Tests. RelMiCS Kamal Aboul-Hosn, Dexter Kozen
2006	J	`jnl`	Logic, Language, Information and Computation. Theor. Comput. Sci. Ruy J. G. B. de Queiroz, Dexter Kozen
2006	B	`conf`	On the Representation of Kleene Algebras with Tests. MFCS Dexter Kozen
2006	B	`conf`	Relational Semantics for Higher-Order Programs. MPC Kamal Aboul-Hosn, Dexter Kozen
2006	—	`book`	Theory of Computation. Dexter Kozen
2005	—	`conf`	Kleene Algebra and Bytecode Verification. Bytecode@ETAPS Lucja Kot, Dexter Kozen
2005	A	`conf`	Supporting workflow in a course management system. SIGCSE 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
2004	J	`jnl`	Computational inductive definability. Ann. Pure Appl. Log. Dexter Kozen
2004	B	`ed.`	Mathematics of Program Construction, 7th International Conference, MPC 2004, Stirling, Scotland, UK, July 12-14, 2004, Proceedings MPC Dexter Kozen, Carron Shankland
2004	J	`jnl`	Some results in dynamic model theory. Sci. Comput. Program. Dexter Kozen
2003	—	`conf`	Efficient Code Certification for Open Firmware. DISCEX (2) Matthew Stillerman, Dexter Kozen
2003	J	`jnl`	Substructural logic and partial correctness. ACM Trans. Comput. Log. Dexter Kozen, Jerzy Tiuryn
2002	—	`conf`	Eager Class Initialization for Java. FTRTFT Dexter Kozen, Matthew Stillerman
2002	A	`conf`	Malicious Code Detection for Open Firmware. ACSAC Frank Adelstein, Matthew Stillerman, Dexter Kozen
2002	J	`jnl`	On the Complexity of Reasoning in Kleene Algebra. Inf. Comput. Dexter Kozen
2002	—	`conf`	On two letters versus three. FICS Dexter Kozen
2002	B	`conf`	Some Results in Dynamic Model Theory. MPC Dexter Kozen
2002	J	`jnl`	Tarskian Set Constraints. Inf. Comput. Robert Givan, David A. McAllester, Carl Witty, Dexter Kozen
2001	J	`jnl`	Dynamic logic. SIGACT News David Harel, Dexter Kozen, Jerzy Tiuryn
2001	A*	`conf`	Intuitionistic Linear Logic and Partial Correctness. LICS Dexter Kozen, Jerzy Tiuryn
2001	A	`conf`	Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra. STACS Dexter Kozen
2001	J	`jnl`	On the completeness of propositional Hoare logic. Inf. Sci. Dexter Kozen, Jerzy Tiuryn
2000	J	`jnl`	A note on the complexity of propositional Hoare logic. ACM Trans. Comput. Log. Ernie Cohen, Dexter Kozen
2000	—	`conf`	Certification of Compiler Optimizations Using Kleene Algebra with Tests. Computational Logic Dexter Kozen, Maria-Christina Patron
2000	J	`jnl`	On Hoare logic and Kleene algebra with tests. ACM Trans. Comput. Log. Dexter Kozen
2000	—	`conf`	On the Completeness of Propositional Hoare Logic. RelMiCS Dexter Kozen, Jerzy Tiuryn
1999	B	`conf`	Language-Based Security. MFCS Dexter Kozen
1999	A*	`conf`	On Hoare Logic and Kleene Algebra with Tests. LICS Dexter Kozen
1999	A*	`conf`	Parikh's Theorem in Commutative Kleene Algebra. LICS Mark W. Hopkins, Dexter Kozen
1998	B	`conf`	Efficient Algorithms for Optimal Video Transmission. Data Compression Conference Dexter Kozen, Yaron Minsky, Brian C. Smith
1998	J	`jnl`	Set Constraints and Logic Programming. Inf. Comput. Dexter Kozen
1997	—	`book`	Automata and computability. Dexter Kozen
1997	J	`jnl`	Computing the Newtonian Graph. J. Symb. Comput. Dexter Kozen, Kjartan Stefánsson
1997	J	`jnl`	Kleene Algebra with Tests. ACM Trans. Program. Lang. Syst. Dexter Kozen
1997	A*	`conf`	On the Complexity of Reasoning in Kleene Algebra. LICS Dexter Kozen
1996	A*	`conf`	A Complete Gentzen-Style Axiomatization for Set Constraints. ICALP Allan Cheng, Dexter Kozen
1996	J	`jnl`	Decomposition of Algebraic Functions. J. Symb. Comput. Dexter Kozen, Susan Landau, Richard Zippel
1996	A	`conf`	Kleene Algebra with Tests and Commutativity Conditions. TACAS Dexter Kozen
1996	B	`conf`	Kleene Algebra with Tests: Completeness and Decidability. CSL Dexter Kozen, Frederick Smith
1996	J	`jnl`	On Regularity-Preserving Functions. Bull. EATCS Dexter Kozen
1996	J	`jnl`	Rational Spaces and Set Constraints. Theor. Comput. Sci. Dexter Kozen
1996	A*	`conf`	Tarskian Set Constraints. LICS David A. McAllester, Robert Givan, Carl Witty, Dexter Kozen
1995	J	`jnl`	Decidability of Systems of Set Constraints with Negative Constraints Inf. Comput. Alexander Aiken, Dexter Kozen, Edward L. Wimmers
1995	J	`jnl`	Efficient Recursive Subtyping. Math. Struct. Comput. Sci. Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach
1995	J	`jnl`	Rabin Measures. Chic. J. Theor. Comput. Sci. Nils Klarlund, Dexter Kozen
1995	—	`conf`	Rational Spaces and Set Constraints. TAPSOFT Dexter Kozen
1994	J	`jnl`	A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events Inf. Comput. Dexter Kozen
1994	—	`conf`	Decomposition of algebraic functions. ANTS Dexter Kozen, Susan Landau, Richard Zippel
1994	A*	`conf`	Efficient Average-Case Algorithms for the Modular Group FOCS Jin-Yi Cai, Wolfgang H. J. Fuchs, Dexter Kozen, Zicheng Liu
1994	J	`jnl`	Efficient Average-Case Algorithms for the Modular Group Electron. Colloquium Comput. Complex. Jin-Yi Cai, Wolfgang H. J. Fuchs, Dexter Kozen, Zicheng Liu
1994	J	`jnl`	Efficient Inference of Partial Types. J. Comput. Syst. Sci. Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach
1994	—	`conf`	Efficient Resolution of Singularities of Plane Curves. FSTTCS Dexter Kozen
1994	J	`jnl`	Optimal Bounds for the Change-Making Problem. Theor. Comput. Sci. Dexter Kozen, Shmuel Zaks
1994	—	`conf`	Set Constraints and Logic Programming. CCL Dexter Kozen
1993	A*	`conf`	Efficient Recursive Subtyping. POPL Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach
1993	B	`conf`	Logical Aspects of Set Constraints. CSL Dexter Kozen
1993	A*	`conf`	Optimal Bounds for the Change-Making Problem. ICALP Dexter Kozen, Shmuel Zaks
1993	B	`conf`	The Complexity of Set Constraints. CSL Alexander Aiken, Dexter Kozen, Moshe Y. Vardi, Edward L. Wimmers
1992	A*	`conf`	Efficient Inference of Partial Types FOCS Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach
1992	J	`jnl`	On the Myhill-Nerode theorem theorem for trees. Bull. EATCS Dexter Kozen
1991	A*	`conf`	A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events LICS Dexter Kozen
1991	A*	`conf`	Rabin Measures and Their Applications to Fairness and Automata Theory LICS Nils Klarlund, Dexter Kozen
1990	—	`ch.`	Logics of Programs. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) Dexter Kozen, Jerzy Tiuryn
1990	B	`conf`	On Kleene Algebras and Closed Semirings. MFCS Dexter Kozen
1989	J	`jnl`	Definability with Bounded Number of Bound Variables Inf. Comput. Neil Immerman, Dexter Kozen
1989	J	`jnl`	Polynomial Decomposition Algorithms. J. Symb. Comput. Dexter Kozen, Susan Landau
1988	J	`jnl`	A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots. SIAM J. Comput. Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari
1988	J	`jnl`	A finite model theorem for the propositional μ-calculus. Stud Logica Dexter Kozen
1987	A*	`conf`	Definability with Bounded Number of Bound Variables LICS Neil Immerman, Dexter Kozen
1987	A*	`conf`	Functional Decomposition of Polynomials FOCS Joachim von zur Gathen, Dexter Kozen, Susan Landau
1986	A*	`conf`	A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots STOC Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari
1986	J	`jnl`	Fast parallel orthogonalization. SIGACT News Dexter Kozen
1986	J	`jnl`	Limits for Automatic Verification of Finite-State Concurrent Systems. Inf. Process. Lett. Krzysztof R. Apt, Dexter Kozen
1986	J	`jnl`	The Complexity of Elementary Algebra and Geometry. J. Comput. Syst. Sci. Michael Ben-Or, Dexter Kozen, John H. Reif
1985	J	`jnl`	A Probabilistic PDL. J. Comput. Syst. Sci. Dexter Kozen
1985	J	`jnl`	A Zero-One Law for Logic with a Fixed-Point Operator Inf. Control. Andreas Blass, Yuri Gurevich, Dexter Kozen
1985	A*	`conf`	Algebraic Cell Decomposition in NC (Preliminary Version) FOCS Dexter Kozen, Chee-Keng Yap
1985	—	`conf`	NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching. FSTTCS Dexter Kozen, Umesh V. Vazirani, Vijay V. Vazirani
1984	J	`jnl`	A Programming Language for the Inductive Sets, and Applications Inf. Control. David Harel, Dexter Kozen
1984	A*	`conf`	Generalized Fair Termination. POPL Nissim Francez, Dexter Kozen
1984	—	`ed.`	Logics of Programs, Workshop, Carnegie Mellon University, Pittsburgh, PA, USA, June 6-8, 1983, Proceedings Logics of Programs Edmund M. Clarke, Dexter Kozen
1984	A*	`conf`	Pebblings, Edgings, and Equational Logic STOC Dexter Kozen
1984	A*	`conf`	The Complexity of Elementary Algebra and Geometry (Preliminary Abstract) STOC Michael Ben-Or, Dexter Kozen, John H. Reif
1983	—	`conf`	A Decision Procedure for the Propositional µ-Calculus. Logic of Programs Dexter Kozen, Rohit Parikh
1983	A*	`conf`	A Probabilistic PDL STOC Dexter Kozen
1983	J	`jnl`	Results on the Propositional mu-Calculus. Theor. Comput. Sci. Dexter Kozen
1982	A*	`conf`	A Programming Language for the Inductive Sets, and Applications. ICALP David Harel, Dexter Kozen
1982	—	`ed.`	Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981 Logics of Programs Dexter Kozen
1982	J	`jnl`	Process Logic: Expressiveness, Decidability, Completeness. J. Comput. Syst. Sci. David Harel, Dexter Kozen, Rohit Parikh
1982	A*	`conf`	Results on the Propositional µ-Calculus. ICALP Dexter Kozen
1981	J	`jnl`	Alternation. J. ACM Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer
1981	J	`jnl`	An Elementary Proof of the Completness of PDL. Theor. Comput. Sci. Dexter Kozen, Rohit Parikh
1981	J	`jnl`	Communication: Positive First-Order Logic is NP-Complete. IBM J. Res. Dev. Dexter Kozen
1981	—	`conf`	On Induction vs. *-Continuity. Logic of Programs Dexter Kozen
1981	J	`jnl`	Semantics of Probabilistic Programs. J. Comput. Syst. Sci. Dexter Kozen
1980	A*	`conf`	A Representation Theorem for Models of *-Free PDL. ICALP Dexter Kozen
1980	J	`jnl`	Complexity of Boolean Algebras. Theor. Comput. Sci. Dexter Kozen
1980	J	`jnl`	Indexings of Subrecursive Classes. Theor. Comput. Sci. Dexter Kozen
1980	A*	`conf`	Process Logic: Expressiveness, Decidability, Completeness FOCS David Harel, Dexter Kozen, Rohit Parikh
1979	B	`conf`	Automata and planar graphs. FCT Dexter Kozen
1979	—	`conf`	On the Duality of Dynamic Algebras and Kripke Models. Logic of Programs Dexter Kozen
1979	A*	`conf`	Semantics of Probabilistic Programs FOCS Dexter Kozen
1978	J	`jnl`	A clique problem equivalent to graph isomorphism. SIGACT News Dexter Kozen
1978	A*	`conf`	Indexing of Subrecursive Classes STOC Dexter Kozen
1978	A*	`conf`	On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs) FOCS Manuel Blum, Dexter Kozen
1977	A*	`conf`	Complexity of Finitely Presented Algebras STOC Dexter Kozen
1977	A*	`conf`	Lower Bounds for Natural Proof Systems FOCS Dexter Kozen
1976	A*	`conf`	On Parallelism in Turing Machines FOCS Dexter Kozen