default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDexter Kozen
Dexter Campbell Kozen
Person information
- affiliation: Cornell University, Computer Science Department
- award (2016): W. Wallace McDowell Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j67]Noam Zilberstein
, Dexter Kozen, Alexandra Silva, Joseph Tassarotti:
A Demonic Outcome Logic for Randomized Nondeterminism. Proc. ACM Program. Lang. 9(POPL): 539-568 (2025)- [c107]Pedro H. Azevedo de Amorim, Leon Witzman, Dexter Kozen:
Classical Linear Logic in Perfect Banach Lattices. CSL 2025: 44:1-44:21 - 2024
- [c106]Dexter Kozen, Alexandra Silva:
Multisets and Distributions. Logics and Type Systems in Theory and Practice 2024: 168-187 - [c105]Jan Rooduijn, Dexter Kozen, Alexandra Silva:
A Cyclic Proof System for Guarded Kleene Algebra with Tests. IJCAR (2) 2024: 257-275 - [i22]Jan Rooduijn, Dexter Kozen, Alexandra Silva:
A cyclic proof system for Guarded Kleene Algebra with Tests (full version). CoRR abs/2405.07505 (2024) - [i21]Noam Zilberstein, Dexter Kozen, Alexandra Silva, Joseph Tassarotti:
A Demonic Outcome Logic for Randomized Nondeterminism. CoRR abs/2410.22540 (2024) - [i20]Shawn Ong, Stephanie Ma, Dexter Kozen:
Probability and Angelic Nondeterminism with Multiset Semantics. CoRR abs/2412.06754 (2024) - 2023
- [j66]Anshuman Mohan, Yunhe Liu, Nate Foster, Tobias Kappé, Dexter Kozen:
Formal Abstractions for Packet Scheduling. Proc. ACM Program. Lang. 7(OOPSLA2): 1338-1362 (2023) - [c104]Keri D'Angelo, Dexter Kozen:
Abstract Huffman Coding and PIFO Tree Embeddings. DCC 2023: 1 - [c103]Wojciech Rozowski, Tobias Kappé, Dexter Kozen, Todd Schmid, Alexandra Silva:
Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity. ICALP 2023: 136:1-136:20 - [c102]Dexter Kozen, Alexandra Silva, Erik Voogd:
Joint Distributions in Probabilistic Semantics. MFPS 2023 - [d1]Anshuman Mohan, Yunhe Liu, Nate Foster, Tobias Kappé, Dexter Kozen:
Formal Abstractions for Packet Scheduling. Zenodo, 2023
- [i19]Keri D'Angelo, Dexter Kozen:
Abstract Huffman Coding and PIFO Tree Embeddings. CoRR abs/2301.02878 (2023) - [i18]Dexter Kozen, Alexandra Silva:
Multisets and Distributions. CoRR abs/2301.10812 (2023) - [i17]Wojciech Rozowski, Tobias Kappé, Dexter Kozen, Todd Schmid, Alexandra Silva:
Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity. CoRR abs/2305.01755 (2023) - 2022
- [j65]Mark Bickford, Dexter Kozen, Alexandra Silva:
Formalizing Moessner's theorem and generalizations in Nuprl. J. Log. Algebraic Methods Program. 124: 100713 (2022) - [j64]Dexter Kozen, Matvey Soloviev:
Coalgebraic tools for randomness-conserving protocols. J. Log. Algebraic Methods Program. 125: 100734 (2022) - [j63]Dexter Kozen:
Reminiscences of Juris. SIGACT News 53(4): 32-34 (2022) - [j62]Dexter Kozen:
2022 Alonzo Church Award Announcement. ACM SIGLOG News 9(4): 2-3 (2022) - [c101]Jana Wagemaker, Nate Foster, Tobias Kappé, Dexter Kozen, Jurriaan Rot, Alexandra Silva:
Concurrent NetKAT - Modeling and analyzing stateful, concurrent networks. ESOP 2022: 575-602 - [i16]Jana Wagemaker, Nate Foster, Tobias Kappé, Dexter Kozen, Jurriaan Rot, Alexandra Silva:
Concurrent NetKAT: Modeling and analyzing stateful, concurrent networks. CoRR abs/2201.10485 (2022) - [i15]Anshuman Mohan, Yunhe Liu, Nate Foster, Tobias Kappé, Dexter Kozen:
Formal Abstractions for Packet Scheduling. CoRR abs/2211.11659 (2022) - 2021
- [c100]Todd Schmid, Tobias Kappé, Dexter Kozen, Alexandra Silva:
Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness. ICALP 2021: 142:1-142:14 - [c99]Pedro H. Azevedo de Amorim, Dexter Kozen, Radu Mardare, Prakash Panangaden, Michael Roberts:
Universal Semantics for the Stochastic λ-Calculus. LICS 2021: 1-12 - [i14]Todd Schmid, Tobias Kappé, Dexter Kozen, Alexandra Silva:
Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness. CoRR abs/2102.08286 (2021) - 2020
- [j61]Fredrik Dahlqvist, Dexter Kozen:
Semantics of higher-order probabilistic programs with conditioning. Proc. ACM Program. Lang. 4(POPL): 57:1-57:29 (2020) - [j60]Steffen Smolka, Nate Foster, Justin Hsu, Tobias Kappé, Dexter Kozen, Alexandra Silva:
Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time. Proc. ACM Program. Lang. 4(POPL): 61:1-61:28 (2020) - [j59]Dexter Kozen, Alexandra Silva:
Left-handed completeness. Theor. Comput. Sci. 807: 220-233 (2020) - [p2]Fredrik Dahlqvist, Alexandra Silva, Dexter Kozen:
Semantics of Probabilistic Programming: A Gentle Introduction. Foundations of Probabilistic Programming 2020: 1-42 - [i13]Nick Bezhanishvili, Marcello M. Bonsangue, Helle Hvid Hansen, Dexter Kozen, Clemens Kupke, Prakash Panangaden, Alexandra Silva:
Minimisation in Logical Form. CoRR abs/2005.11551 (2020) - [i12]Pedro H. Azevedo de Amorim, Dexter Kozen, Radu Mardare, Prakash Panangaden, Michael Roberts:
Universal Semantics for the Stochastic Lambda-Calculus. CoRR abs/2011.13171 (2020)
2010 – 2019
- 2019
- [j58]Dexter Kozen:
Natural Transformations as Rewrite Rules and Monad Composition. Log. Methods Comput. Sci. 15(1) (2019) - [j57]Zoltán Ésik, Dexter Kozen:
On Free ω-Continuous and Regular Ordered Algebras. Log. Methods Comput. Sci. 15(4) (2019) - [c98]Steffen Smolka, Praveen Kumar, David M. Kahn, Nate Foster, Justin Hsu, Dexter Kozen, Alexandra Silva:
Scalable verification of probabilistic networks. PLDI 2019: 190-203 - [i11]Fredrik Dahlqvist, Dexter Kozen:
Semantics of higher-order probabilistic programs with conditioning. CoRR abs/1902.11189 (2019) - [i10]Steffen Smolka, Praveen Kumar, David M. Kahn, Nate Foster, Justin Hsu, Dexter Kozen, Alexandra Silva:
Scalable Verification of Probabilistic Networks. CoRR abs/1904.08096 (2019) - [i9]Steffen Smolka, Nate Foster, Justin Hsu, Tobias Kappé, Dexter Kozen, Alexandra Silva:
Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time. CoRR abs/1907.05920 (2019) - 2018
- [c97]Dexter Kozen, Matvey Soloviev:
Coalgebraic Tools for Randomness-Conserving Protocols. RAMiCS 2018: 298-313 - [c96]Dexter Kozen, Thomas Schwentick:
The Ackermann Award 2018. CSL 2018: 1:1-1:5 - [c95]Giorgio Bacci, Robert Furber, Dexter Kozen, Radu Mardare, Prakash Panangaden, Dana S. Scott:
Boolean-Valued Semantics for the Stochastic λ-Calculus. LICS 2018: 669-678 - [i8]Dexter Kozen, Matvey Soloviev:
Coalgebraic Tools for Randomness-Conserving Protocols. CoRR abs/1807.02735 (2018) - 2017
- [j56]Niels Bjørn Bugge Grathwohl, Fritz Henglein, Dexter Kozen:
Infinitary Axiomatization of the Equational Theory of Context-Free Languages. Fundam. Informaticae 150(3-4): 241-257 (2017) - [j55]Jean-Baptiste Jeannin, Dexter Kozen, Alexandra Silva:
CoCaml: Functional Programming with Regular Coinductive Types. Fundam. Informaticae 150(3-4): 347-377 (2017) - [j54]Dexter Kozen, Konstantinos Mamouras, Alexandra Silva:
Completeness and incompleteness in nominal Kleene algebra. J. Log. Algebraic Methods Program. 91: 17-32 (2017) - [j53]Jean-Baptiste Jeannin, Dexter Kozen, Alexandra Silva:
Well-founded coalgebras, revisited. Math. Struct. Comput. Sci. 27(7): 1111-1131 (2017) - [j52]Dexter Kozen, Alexandra Silva:
Practical coinduction. Math. Struct. Comput. Sci. 27(7): 1132-1152 (2017) - [c94]Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann:
Nominal Automata with Name Binding. FoSSaCS 2017: 124-142 - [c93]Robert Furber, Dexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden:
Unrestricted stone duality for Markov processes. LICS 2017: 1-9 - [c92]Steffen Smolka, Praveen Kumar, Nate Foster, Dexter Kozen, Alexandra Silva:
Cantor meets scott: semantic foundations for probabilistic networks. POPL 2017: 557-571 - [i7]Steffen Smolka, David M. Kahn, Praveen Kumar, Nate Foster, Dexter Kozen, Alexandra Silva:
Deciding Probabilistic Program Equivalence in NetKAT. CoRR abs/1707.02772 (2017) - 2016
- [c91]Nate Foster, Dexter Kozen, Konstantinos Mamouras, Mark Reitblatt, Alexandra Silva:
Probabilistic NetKAT. ESOP 2016: 282-309 - [c90]Dexter Kozen:
Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes. LICS 2016: 692-699 - [i6]Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann:
Nominal Automata with Name Binding. CoRR abs/1603.01455 (2016) - [i5]Steffen Smolka, Praveen Kumar, Nate Foster, Dexter Kozen, Alexandra Silva:
Cantor meets Scott: Domain-Theoretic Foundations for Probabilistic Network Programming. CoRR abs/1607.05830 (2016) - [i4]Zoltán Ésik, Dexter Kozen:
On Free ω-Continuous and Regular Ordered Algebras. CoRR abs/1612.02106 (2016) - [i3]Dexter Kozen:
Natural Transformations as Rewrite Rules and Monad Composition. CoRR abs/1612.07273 (2016) - 2015
- [c89]Dexter Kozen, Konstantinos Mamouras, Alexandra Silva:
Completeness and Incompleteness in Nominal Kleene Algebra. RAMiCS 2015: 51-66 - [c88]Anuj Dawar, Dexter Kozen, Simona Ronchi Della Rocca:
The Ackermann Award 2015. CSL 2015: xv-xviii - [c87]Dexter Kozen, Konstantinos Mamouras, Daniela Petrisan, Alexandra Silva:
Nominal Kleene Coalgebra. ICALP (2) 2015: 286-298 - [c86]Nate Foster, Dexter Kozen, Mae Milano, Alexandra Silva, Laure Thompson:
A Coalgebraic Decision Procedure for NetKAT. POPL 2015: 343-355 - 2014
- [c85]Dexter Kozen:
NetKAT - A Formal System for the Verification of Networks. APLAS 2014: 1-18 - [c84]Dexter Kozen:
Optimal Coin Flipping. Horizons of the Mind 2014: 407-426 - [c83]Dexter Kozen:
Citations for the test-of-time award from 1994. CSL-LICS 2014: 6:1 - [c82]Niels Bjørn Bugge Grathwohl, Dexter Kozen, Konstantinos Mamouras:
KAT + B! CSL-LICS 2014: 44:1-44:10 - [c81]Dexter Kozen, Konstantinos Mamouras:
Kleene Algebra with Equations. ICALP (2) 2014: 280-292 - [c80]Carolyn Jane Anderson, Nate Foster, Arjun Guha, Jean-Baptiste Jeannin, Dexter Kozen, Cole Schlesinger, David Walker:
NetkAT: semantic foundations for networks. POPL 2014: 113-126 - [c79]Dexter Kozen, Radu Mardare, Prakash Panangaden:
A Metrized Duality Theorem for Markov Processes. MFPS 2014: 211-227 - 2013
- [j51]Henk Barendregt, Venanzio Capretta, Dexter Kozen:
Reflection in the Chomsky Hierarchy. J. Autom. Lang. Comb. 18(1): 53-60 (2013) - [j50]Dexter Kozen, Alexandra Silva:
On Moessner's Theorem. Am. Math. Mon. 120(2): 131-139 (2013) - [c78]Dexter Kozen, Konstantinos Mamouras:
Kleene Algebra with Products and Iteration Theories. CSL 2013: 415-431 - [c77]Jean-Baptiste Jeannin, Dexter Kozen, Alexandra Silva:
Language Constructs for Non-Well-Founded Computation. ESOP 2013: 61-80 - [c76]Dexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden:
Stone Duality for Markov Processes. LICS 2013: 321-330 - [c75]Dexter Kozen, Radu Mardare, Prakash Panangaden:
Strong Completeness for Markovian Logics. MFCS 2013: 655-666 - [c74]Niels Bjørn Bugge Grathwohl, Fritz Henglein, Dexter Kozen:
Infinitary Axiomatization of the Equational Theory of Context-Free Languages. FICS 2013: 44-55 - [c73]Dexter Kozen, Michael W. Mislove:
Preface. MFPS 2013: 1-2 - [e4]Dexter Kozen, Michael W. Mislove:
Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, MFPS 2013, New Orleans, LA, USA, June 23-25, 2013. Electronic Notes in Theoretical Computer Science 298, Elsevier 2013 [contents] - 2012
- [j49]Jean-Baptiste Jeannin, Dexter Kozen:
Computing with Capsules. J. Autom. Lang. Comb. 17(2-4): 185-204 (2012) - [c72]Dexter Kozen, Alexandra Silva:
Left-Handed Completeness. RAMiCS 2012: 162-178 - [c71]Jean-Baptiste Jeannin, Dexter Kozen:
Computing with Capsules. DCFS 2012: 1-19 - [c70]Jean-Baptiste Jeannin, Dexter Kozen:
Capsules and Separation. LICS 2012: 425-430 - [c69]Dexter Kozen:
New. MFPS 2012: 17-42 - 2011
- [c68]Dexter Kozen:
Realization of Coinductive Types. MFPS 2011: 237-246 - 2010
- [j48]Dexter Kozen:
Church-Rosser Made Easy. Fundam. Informaticae 103(1-4): 129-136 (2010) - [c67]Dexter Kozen:
Halting and Equivalence of Program Schemes in Models of Arbitrary Theories. Fields of Logic and Computation 2010: 463-469
2000 – 2009
- 2009
- [j47]Dexter Kozen, Nicholas Ruozzi:
Applications of Metric Coinduction. Log. Methods Comput. Sci. 5(3) (2009) - [c66]Nikolaos Karampatziakis, Dexter Kozen:
Learning prediction suffix trees with Winnow. ICML 2009: 489-496 - 2008
- [j46]Kamal Aboul-Hosn, Dexter Kozen:
Local variable scoping and Kleene algebra with tests. J. Log. Algebraic Methods Program. 76(1): 3-17 (2008) - [c65]Dexter Kozen:
Nonlocal Flow of Control and Kleene Algebra with Tests. LICS 2008: 105-117 - [c64]Dexter Kozen, Wei-Lung Dustin Tseng:
The Böhm-Jacopini Theorem Is False, Propositionally. MPC 2008: 177-192 - 2007
- [j45]Dexter Kozen:
Coinductive Proof Principles for Stochastic Processes. Log. Methods Comput. Sci. 3(4) (2007) - [j44]Dexter Kozen:
Preface. Sci. Comput. Program. 65(2): 71 (2007) - [c63]Dexter Kozen, Nicholas Ruozzi:
Applications of Metric Coinduction. CALCO 2007: 327-341 - [c62]Daniel Sheldon, M. A. Saleh Elmohamed, Dexter Kozen:
Collective Inference on Markov Models for Modeling Bird Migration. NIPS 2007: 1321-1328 - [i2]Dexter Kozen:
Coinductive Proof Principles for Stochastic Processes. CoRR abs/0711.0194 (2007) - 2006
- [b3]Dexter Kozen:
Theory of Computation. Texts in Computer Science, Springer 2006, ISBN 978-1-84628-297-3, pp. i-xiii, 1-419 - [j43]Kamal Aboul-Hosn, Dexter Kozen:
KAT-ML: an interactive theorem prover for Kleene algebra with tests. J. Appl. Non Class. Logics 16(1-2): 9-34 (2006) - [j42]Ruy J. G. B. de Queiroz, Dexter Kozen:
Logic, Language, Information and Computation. Theor. Comput. Sci. 355(2): 105-107 (2006) - [c61]Kamal Aboul-Hosn, Dexter Kozen:
Local Variable Scoping and Kleene Algebra with Tests. RelMiCS 2006: 78-90 - [c60]Dexter Kozen, Christoph Kreitz, Eva Richter:
Automating Proofs in Category Theory. IJCAR 2006: 392-407 - [c59]Dexter Kozen:
Coinductive Proof Principles for Stochastic Processes. LICS 2006: 359-366 - [c58]Dexter Kozen:
On the Representation of Kleene Algebras with Tests. MFCS 2006: 73-83 - [c57]Kamal Aboul-Hosn, Dexter Kozen:
Relational Semantics for Higher-Order Programs. MPC 2006: 29-48 - 2005
- [c56]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:
Supporting workflow in a course management system. SIGCSE 2005: 262-266 - [c55]Lucja Kot, Dexter Kozen:
Kleene Algebra and Bytecode Verification. Bytecode@ETAPS 2005: 221-236 - 2004
- [j41]Dexter Kozen:
Computational inductive definability. Ann. Pure Appl. Log. 126(1-3): 139-148 (2004) - [j40]Dexter Kozen:
Some results in dynamic model theory. Sci. Comput. Program. 51(1-2): 3-22 (2004) - [e3]Dexter Kozen, Carron Shankland:
Mathematics of Program Construction, 7th International Conference, MPC 2004, Stirling, Scotland, UK, July 12-14, 2004, Proceedings. Lecture Notes in Computer Science 3125, Springer 2004, ISBN 3-540-22380-0 [contents] - 2003
- [j39]Dexter Kozen, Jerzy Tiuryn:
Substructural logic and partial correctness. ACM Trans. Comput. Log. 4(3): 355-378 (2003) - [c54]Matthew Stillerman, Dexter Kozen:
Efficient Code Certification for Open Firmware. DISCEX (2) 2003: 147-148 - 2002
- [j38]Robert Givan, David A. McAllester, Carl Witty, Dexter Kozen:
Tarskian Set Constraints. Inf. Comput. 174(2): 105-131 (2002) - [j37]Dexter Kozen:
On the Complexity of Reasoning in Kleene Algebra. Inf. Comput. 179(2): 152-162 (2002) - [c53]Frank Adelstein, Matthew Stillerman, Dexter Kozen:
Malicious Code Detection for Open Firmware. ACSAC 2002: 403-412 - [c52]Dexter Kozen:
On two letters versus three. FICS 2002: 44-50 - [c51]Dexter Kozen, Matthew Stillerman:
Eager Class Initialization for Java. FTRTFT 2002: 71-80 - [c50]Dexter Kozen:
Some Results in Dynamic Model Theory. MPC 2002: 21 - 2001
- [j36]Dexter Kozen, Jerzy Tiuryn:
On the completeness of propositional Hoare logic. Inf. Sci. 139(3-4): 187-195 (2001) - [j35]David Harel, Dexter Kozen, Jerzy Tiuryn:
Dynamic logic. SIGACT News 32(1): 66-69 (2001) - [c49]Dexter Kozen, Jerzy Tiuryn:
Intuitionistic Linear Logic and Partial Correctness. LICS 2001: 259-268 - [c48]Dexter Kozen:
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra. STACS 2001: 27-38 - 2000
- [j34]Dexter Kozen:
On Hoare logic and Kleene algebra with tests. ACM Trans. Comput. Log. 1(1): 60-76 (2000) - [j33]Ernie Cohen, Dexter Kozen:
A note on the complexity of propositional Hoare logic. ACM Trans. Comput. Log. 1(1): 171-174 (2000) - [c47]Dexter Kozen, Jerzy Tiuryn:
On the Completeness of Propositional Hoare Logic. RelMiCS 2000: 195-202 - [c46]Dexter Kozen, Maria-Christina Patron:
Certification of Compiler Optimizations Using Kleene Algebra with Tests. Computational Logic 2000: 568-582
1990 – 1999
- 1999
- [c45]Dexter Kozen:
On Hoare Logic and Kleene Algebra with Tests. LICS 1999: 167-172 - [c44]Mark W. Hopkins, Dexter Kozen:
Parikh's Theorem in Commutative Kleene Algebra. LICS 1999: 394-401 - [c43]Dexter Kozen:
Language-Based Security. MFCS 1999: 284-298 - 1998
- [j32]Dexter Kozen:
Set Constraints and Logic Programming. Inf. Comput. 142(1): 2-25 (1998) - [c42]Dexter Kozen, Yaron Minsky, Brian C. Smith:
Efficient Algorithms for Optimal Video Transmission. Data Compression Conference 1998: 229-238 - 1997
- [b2]Dexter Kozen:
Automata and computability. Undergraduate texts in computer science, Springer 1997, ISBN 978-0-387-94907-9, pp. I-XIII, 1-400 - [j31]Dexter Kozen, Kjartan Stefánsson:
Computing the Newtonian Graph. J. Symb. Comput. 24(2): 125-136 (1997) - [j30]Dexter Kozen:
Kleene Algebra with Tests. ACM Trans. Program. Lang. Syst. 19(3): 427-443 (1997) - [c41]Dexter Kozen:
On the Complexity of Reasoning in Kleene Algebra. LICS 1997: 195-202 - 1996
- [j29]Dexter Kozen:
On Regularity-Preserving Functions. Bull. EATCS 58 (1996) - [j28]Dexter Kozen, Susan Landau, Richard Zippel:
Decomposition of Algebraic Functions. J. Symb. Comput. 22(3): 235-246 (1996) - [j27]Dexter Kozen:
Rational Spaces and Set Constraints. Theor. Comput. Sci. 167(1&2): 73-94 (1996) - [c40]Dexter Kozen, Frederick Smith:
Kleene Algebra with Tests: Completeness and Decidability. CSL 1996: 244-259 - [c39]Allan Cheng, Dexter Kozen:
A Complete Gentzen-Style Axiomatization for Set Constraints. ICALP 1996: 134-145 - [c38]David A. McAllester, Robert Givan, Carl Witty, Dexter Kozen:
Tarskian Set Constraints. LICS 1996: 138-147 - [c37]Dexter Kozen:
Kleene Algebra with Tests and Commutativity Conditions. TACAS 1996: 14-33 - 1995
- [j26]Nils Klarlund, Dexter Kozen:
Rabin Measures. Chic. J. Theor. Comput. Sci. 1995 (1995) - [j25]Alexander Aiken, Dexter Kozen, Edward L. Wimmers:
Decidability of Systems of Set Constraints with Negative Constraints. Inf. Comput. 122(1): 30-44 (1995) - [j24]Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach:
Efficient Recursive Subtyping. Math. Struct. Comput. Sci. 5(1): 113-125 (1995) - [c36]Dexter Kozen:
Rational Spaces and Set Constraints. TAPSOFT 1995: 42-61 - 1994
- [j23]Dexter Kozen:
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. Inf. Comput. 110(2): 366-390 (1994) - [j22]Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach:
Efficient Inference of Partial Types. J. Comput. Syst. Sci. 49(2): 306-324 (1994) - [j21]Dexter Kozen, Shmuel Zaks:
Optimal Bounds for the Change-Making Problem. Theor. Comput. Sci. 123(2): 377-388 (1994) - [c35]Dexter Kozen, Susan Landau, Richard Zippel:
Decomposition of algebraic functions. ANTS 1994: 80-92 - [c34]Dexter Kozen:
Set Constraints and Logic Programming. CCL 1994: 302-303 - [c33]Jin-yi Cai, Wolfgang H. J. Fuchs, Dexter Kozen, Zicheng Liu:
Efficient Average-Case Algorithms for the Modular Group. FOCS 1994: 143-152 - [c32]Dexter Kozen:
Efficient Resolution of Singularities of Plane Curves. FSTTCS 1994: 1-11 - [i1]Jin-yi Cai, Wolfgang H. J. Fuchs, Dexter Kozen, Zicheng Liu:
Efficient Average-Case Algorithms for the Modular Group. Electron. Colloquium Comput. Complex. TR94 (1994) - 1993
- [c31]Alexander Aiken, Dexter Kozen, Moshe Y. Vardi, Edward L. Wimmers:
The Complexity of Set Constraints. CSL 1993: 1-17 - [c30]Dexter Kozen:
Logical Aspects of Set Constraints. CSL 1993: 175-188 - [c29]Dexter Kozen, Shmuel Zaks:
Optimal Bounds for the Change-Making Problem. ICALP 1993: 150-161 - [c28]Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach:
Efficient Recursive Subtyping. POPL 1993: 419-428 - 1992
- [b1]Dexter Campbell Kozen:
Design and Analysis of Algorithms. Texts and Monographs in Computer Science, Springer 1992, ISBN 978-3-540-97687-5, pp. I-X, 1-320 - [j20]Dexter Kozen:
On the Myhill-Nerode theorem theorem for trees. Bull. EATCS 47: 170-173 (1992) - [c27]Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach:
Efficient Inference of Partial Types. FOCS 1992: 363-371 - 1991
- [c26]Dexter Kozen:
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. LICS 1991: 214-225 - [c25]Nils Klarlund, Dexter Kozen:
Rabin Measures and Their Applications to Fairness and Automata Theory. LICS 1991: 256-265 - 1990
- [c24]Dexter Kozen:
On Kleene Algebras and Closed Semirings. MFCS 1990: 26-47 - [p1]Dexter Kozen, Jerzy Tiuryn:
Logics of Programs. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 789-840
1980 – 1989
- 1989
- [j19]Neil Immerman, Dexter Kozen:
Definability with Bounded Number of Bound Variables. Inf. Comput. 83(2): 121-139 (1989) - [j18]Dexter Kozen, Susan Landau:
Polynomial Decomposition Algorithms. J. Symb. Comput. 7(5): 445-456 (1989) - 1988
- [j17]Dexter Kozen:
A finite model theorem for the propositional μ-calculus. Stud Logica 47(3): 233-241 (1988) - [j16]Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari:
A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots. SIAM J. Comput. 17(6): 1081-1092 (1988) - 1987
- [c23]Joachim von zur Gathen, Dexter Kozen, Susan Landau:
Functional Decomposition of Polynomials. FOCS 1987: 127-131 - [c22]Neil Immerman, Dexter Kozen:
Definability with Bounded Number of Bound Variables. LICS 1987: 236-244 - 1986
- [j15]Krzysztof R. Apt, Dexter Kozen:
Limits for Automatic Verification of Finite-State Concurrent Systems. Inf. Process. Lett. 22(6): 307-309 (1986) - [j14]Michael Ben-Or, Dexter Kozen, John H. Reif:
The Complexity of Elementary Algebra and Geometry. J. Comput. Syst. Sci. 32(2): 251-264 (1986) - [j13]Dexter Kozen:
Fast parallel orthogonalization. SIGACT News 18(2): 47 (1986) - [c21]Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari:
A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots. STOC 1986: 340-349 - 1985
- [j12]Andreas Blass, Yuri Gurevich, Dexter Kozen:
A Zero-One Law for Logic with a Fixed-Point Operator. Inf. Control. 67(1-3): 70-90 (1985) - [j11]Dexter Kozen:
A Probabilistic PDL. J. Comput. Syst. Sci. 30(2): 162-178 (1985) - [c20]Dexter Kozen, Chee-Keng Yap:
Algebraic Cell Decomposition in NC (Preliminary Version). FOCS 1985: 515-521 - [c19]Dexter Kozen, Umesh V. Vazirani, Vijay V. Vazirani:
NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching. FSTTCS 1985: 496-503 - 1984
- [j10]David Harel, Dexter Kozen:
A Programming Language for the Inductive Sets, and Applications. Inf. Control. 63(1/2): 118-139 (1984) - [c18]Nissim Francez, Dexter Kozen:
Generalized Fair Termination. POPL 1984: 46-53 - [c17]Dexter Kozen:
Pebblings, Edgings, and Equational Logic. STOC 1984: 428-435 - [c16]Michael Ben-Or, Dexter Kozen, John H. Reif:
The Complexity of Elementary Algebra and Geometry (Preliminary Abstract). STOC 1984: 457-464 - [e2]Edmund M. Clarke, Dexter Kozen:
Logics of Programs, Workshop, Carnegie Mellon University, Pittsburgh, PA, USA, June 6-8, 1983, Proceedings. Lecture Notes in Computer Science 164, Springer 1984, ISBN 3-540-12896-4 [contents] - 1983
- [j9]Dexter Kozen:
Results on the Propositional mu-Calculus. Theor. Comput. Sci. 27: 333-354 (1983) - [c15]Dexter Kozen, Rohit Parikh:
A Decision Procedure for the Propositional µ-Calculus. Logic of Programs 1983: 313-325 - [c14]Dexter Kozen:
A Probabilistic PDL. STOC 1983: 291-297 - 1982
- [j8]David Harel, Dexter Kozen, Rohit Parikh:
Process Logic: Expressiveness, Decidability, Completeness. J. Comput. Syst. Sci. 25(2): 144-170 (1982) - [c13]David Harel, Dexter Kozen:
A Programming Language for the Inductive Sets, and Applications. ICALP 1982: 313-329 - [c12]Dexter Kozen:
Results on the Propositional µ-Calculus. ICALP 1982: 348-359 - [e1]Dexter Kozen:
Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981. Lecture Notes in Computer Science 131, Springer 1982, ISBN 3-540-11212-X [contents] - 1981
- [j7]Dexter Kozen:
Communication: Positive First-Order Logic is NP-Complete. IBM J. Res. Dev. 25(4): 327-332 (1981) - [j6]Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer:
Alternation. J. ACM 28(1): 114-133 (1981) - [j5]Dexter Kozen:
Semantics of Probabilistic Programs. J. Comput. Syst. Sci. 22(3): 328-350 (1981) - [j4]Dexter Kozen, Rohit Parikh:
An Elementary Proof of the Completness of PDL. Theor. Comput. Sci. 14: 113-118 (1981) - [c11]Dexter Kozen:
On Induction vs. *-Continuity. Logic of Programs 1981: 167-176 - 1980
- [j3]Dexter Kozen:
Complexity of Boolean Algebras. Theor. Comput. Sci. 10: 221-247 (1980) - [j2]Dexter Kozen:
Indexings of Subrecursive Classes. Theor. Comput. Sci. 11: 277-301 (1980) - [c10]David Harel, Dexter Kozen, Rohit Parikh:
Process Logic: Expressiveness, Decidability, Completeness. FOCS 1980: 129-142 - [c9]Dexter Kozen:
A Representation Theorem for Models of *-Free PDL. ICALP 1980: 351-362
1970 – 1979
- 1979
- [c8]Dexter Kozen:
Automata and planar graphs. FCT 1979: 243-254 - [c7]Dexter Kozen:
Semantics of Probabilistic Programs. FOCS 1979: 101-114 - [c6]Dexter Kozen:
On the Duality of Dynamic Algebras and Kripke Models. Logic of Programs 1979: 1-11 - 1978
- [j1]Dexter Kozen:
A clique problem equivalent to graph isomorphism. SIGACT News 10(2): 50-52 (1978) - [c5]Manuel Blum, Dexter Kozen:
On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs). FOCS 1978: 132-142 - [c4]Dexter Kozen:
Indexing of Subrecursive Classes. STOC 1978: 287-295 - 1977
- [c3]Dexter Kozen:
Lower Bounds for Natural Proof Systems. FOCS 1977: 254-266 - [c2]Dexter Kozen:
Complexity of Finitely Presented Algebras. STOC 1977: 164-177 - 1976
- [c1]Dexter Kozen:
On Parallelism in Turing Machines. FOCS 1976: 89-97
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-14 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
