Dexter Kozen

Dexter Kozen, Alexandra Silva: On Moessner's Theorem. The American Mathematical Monthly 120(2): 131-139 (2013)

Jean-Baptiste Jeannin, Dexter Kozen, Alexandra Silva: Language Constructs for Non-Well-Founded Computation. ESOP 2013: 61-80

Dexter Kozen: New. Electr. Notes Theor. Comput. Sci. 286: 17-42 (2012)

Dexter Kozen, Alexandra Silva: Left-Handed Completeness. RAMICS 2012: 162-178

Jean-Baptiste Jeannin, Dexter Kozen: Computing with Capsules. DCFS 2012: 1-19

Jean-Baptiste Jeannin, Dexter Kozen: Capsules and Separation. LICS 2012: 425-430

Dexter Kozen: Realization of Coinductive Types. Electr. Notes Theor. Comput. Sci. 276: 237-246 (2011)

Dexter Kozen: Church-Rosser Made Easy. Fundam. Inform. 103(1-4): 129-136 (2010)

Dexter Kozen: Halting and Equivalence of Program Schemes in Models of Arbitrary Theories. Fields of Logic and Computation 2010: 463-469

Dexter Kozen, Nicholas Ruozzi: Applications of Metric Coinduction. Logical Methods in Computer Science 5(3) (2009)

Nikolaos Karampatziakis, Dexter Kozen: Learning prediction suffix trees with Winnow. ICML 2009: 62

Kamal Aboul-Hosn, Dexter Kozen: Local variable scoping and Kleene algebra with tests. J. Log. Algebr. Program. 76(1): 3-17 (2008)

Dexter Kozen: Nonlocal Flow of Control and Kleene Algebra with Tests. LICS 2008: 105-117

Dexter Kozen, Wei-Lung Dustin Tseng: The Böhm-Jacopini Theorem Is False, Propositionally. MPC 2008: 177-192

Dexter Kozen: Coinductive Proof Principles for Stochastic Processes. Logical Methods in Computer Science 3(4) (2007)

Dexter Kozen: Preface. Sci. Comput. Program. 65(2): 71 (2007)

Dexter Kozen, Nicholas Ruozzi: Applications of Metric Coinduction. CALCO 2007: 327-341

Daniel Sheldon, M. A. Saleh Elmohamed, Dexter Kozen: Collective Inference on Markov Models for Modeling Bird Migration. NIPS 2007

Dexter Kozen: Coinductive Proof Principles for Stochastic Processes. CoRR abs/0711.0194 (2007)

Kamal Aboul-Hosn, Dexter Kozen: KAT-ML: an interactive theorem prover for Kleene algebra with tests. Journal of Applied Non-Classical Logics 16(1-2): 9-34 (2006)

Ruy J. G. B. de Queiroz, Dexter Kozen: Logic, Language, Information and Computation. Theor. Comput. Sci. 355(2): 105-107 (2006)

Kamal Aboul-Hosn, Dexter Kozen: Local Variable Scoping and Kleene Algebra with Tests. RelMiCS 2006: 78-90

Dexter Kozen, Christoph Kreitz, Eva Richter: Automating Proofs in Category Theory. IJCAR 2006: 392-407

Dexter Kozen: Coinductive Proof Principles for Stochastic Processes. LICS 2006: 359-366

Dexter Kozen: On the Representation of Kleene Algebras with Tests. MFCS 2006: 73-83

Kamal Aboul-Hosn, Dexter Kozen: Relational Semantics for Higher-Order Programs. MPC 2006: 29-48

Lucja Kot, Dexter Kozen: Kleene Algebra and Bytecode Verification. Electr. Notes Theor. Comput. Sci. 141(1): 221-236 (2005)

Chavdar Botev, Hubert Chao, Theodore Chao, Yim Cheng, Raymond Doyle, Sergey Grankin, Jon Guarino, Saikat Guha, Pei-Chen Lee, Dan Perry, Christopher Re, 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

Dexter Kozen: Computational inductive definability. Ann. Pure Appl. Logic 126(1-3): 139-148 (2004)

Dexter Kozen: Some results in dynamic model theory. Sci. Comput. Program. 51(1-2): 3-22 (2004)

Dexter Kozen, Carron Shankland (Eds.): 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

Dexter Kozen, Jerzy Tiuryn: Substructural logic and partial correctness. ACM Trans. Comput. Log. 4(3): 355-378 (2003)

Matthew Stillerman, Dexter Kozen: Efficient Code Certification for Open Firmware. DISCEX (2) 2003: 147-148

Robert Givan, David A. McAllester, Carl Witty, Dexter Kozen: Tarskian Set Constraints. Inf. Comput. 174(2): 105-131 (2002)

Dexter Kozen: On the Complexity of Reasoning in Kleene Algebra. Inf. Comput. 179(2): 152-162 (2002)

Frank Adelstein, Matthew Stillerman, Dexter Kozen: Malicious Code Detection for Open Firmware. ACSAC 2002: 403-412

Dexter Kozen: On two letters versus three. FICS 2002: 44-50

Dexter Kozen, Matthew Stillerman: Eager Class Initialization for Java. FTRTFT 2002: 71-80

Dexter Kozen: Some Results in Dynamic Model Theory. MPC 2002: 21

Dexter Kozen, Jerzy Tiuryn: On the completeness of propositional Hoare logic. Inf. Sci. 139(3-4): 187-195 (2001)

David Harel, Dexter Kozen, Jerzy Tiuryn: Dynamic logic. SIGACT News 32(1): 66-69 (2001)

Dexter Kozen, Jerzy Tiuryn: Intuitionistic Linear Logic and Partial Correctness. LICS 2001: 259-268

Dexter Kozen: Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra. STACS 2001: 27-38

Dexter Kozen: On Hoare logic and Kleene algebra with tests. ACM Trans. Comput. Log. 1(1): 60-76 (2000)

Ernie Cohen, Dexter Kozen: A note on the complexity of propositional Hoare logic. ACM Trans. Comput. Log. 1(1): 171-174 (2000)

Dexter Kozen, Jerzy Tiuryn: On the Completeness of Propositional Hoare Logic. RelMiCS 2000: 195-202

Dexter Kozen, Maria-Christina Patron: Certification of Compiler Optimizations Using Kleene Algebra with Tests. Computational Logic 2000: 568-582

Dexter Kozen: On Hoare Logic and Kleene Algebra with Tests. LICS 1999: 167-172

Mark W. Hopkins, Dexter Kozen: Parikh's Theorem in Commutative Kleene Algebra. LICS 1999: 394-401

Dexter Kozen: Language-Based Security. MFCS 1999: 284-298

Dexter Kozen: Set Constraints and Logic Programming. Inf. Comput. 142(1): 2-25 (1998)

Dexter Kozen, Yaron Minsky, Brian C. Smith: Efficient Algorithms for Optimal Video Transmission. Data Compression Conference 1998: 229-238

Dexter Kozen: Automata and computability. Undergraduate texts in computer science, Springer 1997, isbn 978-0-387-94907-9, pp. I-XIII, 1-400

Dexter Kozen, Kjartan Stefánsson: Computing the Newtonian Graph. J. Symb. Comput. 24(2): 125-136 (1997)

Dexter Kozen: Kleene Algebra with Tests. ACM Trans. Program. Lang. Syst. 19(3): 427-443 (1997)

Dexter Kozen: On the Complexity of Reasoning in Kleene Algebra. LICS 1997: 195-202

Dexter Kozen: On Regularity-Preserving Functions. Bulletin of the EATCS 58 (1996)

Dexter Kozen, Susan Landau, Richard Zippel: Decomposition of Algebraic Functions. J. Symb. Comput. 22(3): 235-246 (1996)

Dexter Kozen: Rational Spaces and Set Constraints. Theor. Comput. Sci. 167(1&2): 73-94 (1996)

Dexter Kozen, Frederick Smith: Kleene Algebra with Tests: Completeness and Decidability. CSL 1996: 244-259

Allan Cheng, Dexter Kozen: A Complete Gentzen-Style Axiomatization for Set Constraints. ICALP 1996: 134-145

David A. McAllester, Robert Givan, Carl Witty, Dexter Kozen: Tarskian Set Constraints. LICS 1996: 138-147

Dexter Kozen: Kleene Algebra withTests and Commutativity Conditions. TACAS 1996: 14-33

Nils Klarlund, Dexter Kozen: Rabin Measures. Chicago J. Theor. Comput. Sci. 1995 (1995)

Alexander Aiken, Dexter Kozen, Edward L. Wimmers: Decidability of Systems of Set Constraints with Negative Constraints. Inf. Comput. 122(1): 30-44 (1995)

Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach: Efficient Recursive Subtyping. Mathematical Structures in Computer Science 5(1): 113-125 (1995)

Dexter Kozen: Rational Spaces and Set Constraints. TAPSOFT 1995: 42-61

Dexter Kozen: A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. Inf. Comput. 110(2): 366-390 (1994)

Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach: Efficient Inference of Partial Types. J. Comput. Syst. Sci. 49(2): 306-324 (1994)

Dexter Kozen, Shmuel Zaks: Optimal Bounds for the Change-Making Problem. Theor. Comput. Sci. 123(2): 377-388 (1994)

Dexter Kozen, Susan Landau, Richard Zippel: Decomposition of algebraic functions. ANTS 1994: 80-92

Dexter Kozen: Set Constraints and Logic Programming. CCL 1994: 302-303

Jin-yi Cai, Wolfgang H. J. Fuchs, Dexter Kozen, Zicheng Liu: Efficient Average-Case Algorithms for the Modular Group. FOCS 1994: 143-152

Dexter Kozen: Efficient Resolution of Singularities of Plane Curves. FSTTCS 1994: 1-11

Jin-yi Cai, Wolfgang H. J. Fuchs, Dexter Kozen, Zicheng Liu: Efficient Average-Case Algorithms for the Modular Group. Electronic Colloquium on Computational Complexity (ECCC) 1(16) (1994)

Alexander Aiken, Dexter Kozen, Moshe Y. Vardi, Edward L. Wimmers: The Complexity of Set Constraints. CSL 1993: 1-17

Dexter Kozen: Logical Aspects of Set Constraints. CSL 1993: 175-188

Dexter Kozen, Shmuel Zaks: Optimal Bounds for the Change-Making Problem. ICALP 1993: 150-161

Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach: Efficient Recursive Subtyping. POPL 1993: 419-428

Dexter 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

Dexter Kozen: On the Myhill-Nerode theorem theorem for trees. Bulletin of the EATCS 47: 170-173 (1992)

Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach: Efficient Inference of Partial Types. FOCS 1992: 363-371

Dexter Kozen: A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. LICS 1991: 214-225

Nils Klarlund, Dexter Kozen: Rabin Measures and Their Applications to Fairness and Automata Theory. LICS 1991: 256-265

Dexter Kozen, Jerzy Tiuryn: Logics of Programs. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 789-840

Dexter Kozen: On Kleene Algebras and Closed Semirings. MFCS 1990: 26-47

Neil Immerman, Dexter Kozen: Definability with Bounded Number of Bound Variables. Inf. Comput. 83(2): 121-139 (1989)

Dexter Kozen, Susan Landau: Polynomial Decomposition Algorithms. J. Symb. Comput. 7(5): 445-456 (1989)

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)

Joachim von zur Gathen, Dexter Kozen, Susan Landau: Functional Decomposition of Polynomials. FOCS 1987: 127-131

Neil Immerman, Dexter Kozen: Definability with Bounded Number of Bound Variables. LICS 1987: 236-244

Krzysztof R. Apt, Dexter Kozen: Limits for Automatic Verification of Finite-State Concurrent Systems. Inf. Process. Lett. 22(6): 307-309 (1986)

Michael Ben-Or, Dexter Kozen, John H. Reif: The Complexity of Elementary Algebra and Geometry. J. Comput. Syst. Sci. 32(2): 251-264 (1986)

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

Andreas Blass, Yuri Gurevich, Dexter Kozen: A Zero-One Law for Logic with a Fixed-Point Operator. Information and Control 67(1-3): 70-90 (1985)

Dexter Kozen: A Probabilistic PDL. J. Comput. Syst. Sci. 30(2): 162-178 (1985)

Dexter Kozen, Chee-Keng Yap: Algebraic Cell Decomposition in NC (Preliminary Version). FOCS 1985: 515-521

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

David Harel, Dexter Kozen: A Programming Language for the Inductive Sets, and Applications. Information and Control 63(1/2): 118-139 (1984)

Nissim Francez, Dexter Kozen: Generalized Fair Termination. POPL 1984: 46-53

Dexter Kozen: Pebblings, Edgings, and Equational Logic. STOC 1984: 428-435

Michael Ben-Or, Dexter Kozen, John H. Reif: The Complexity of Elementary Algebra and Geometry (Preliminary Abstract). STOC 1984: 457-464

Edmund M. Clarke, Dexter Kozen (Eds.): 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

Dexter Kozen: Results on the Propositional mu-Calculus. Theor. Comput. Sci. 27: 333-354 (1983)

Dexter Kozen, Rohit Parikh: A Decision Procedure for the Propositional µ-Calculus. Logic of Programs 1983: 313-325

Dexter Kozen: A Probabilistic PDL. STOC 1983: 291-297

David Harel, Dexter Kozen, Rohit Parikh: Process Logic: Expressiveness, Decidability, Completeness. J. Comput. Syst. Sci. 25(2): 144-170 (1982)

David Harel, Dexter Kozen: A Programming Language for the Inductive Sets, and Applications. ICALP 1982: 313-329

Dexter Kozen: Results on the Propositional µ-Calculus. ICALP 1982: 348-359

Dexter Kozen (Ed.): Logics of Programs, Workshop, Yorktown Heights, New York, May 1981. Lecture Notes in Computer Science 131, Springer 1982, isbn 3-540-11212-X

Dexter Kozen: Communication: Positive First-Order Logic is NP-Complete. IBM Journal of Research and Development 25(4): 327-332 (1981)

Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer: Alternation. J. ACM 28(1): 114-133 (1981)

Dexter Kozen: Semantics of Probabilistic Programs. J. Comput. Syst. Sci. 22(3): 328-350 (1981)

Dexter Kozen, Rohit Parikh: An Elementary Proof of the Completness of PDL. Theor. Comput. Sci. 14: 113-118 (1981)

Dexter Kozen: On Induction vs. *-Continuity. Logic of Programs 1981: 167-176

Dexter Kozen: Complexity of Boolean Algebras. Theor. Comput. Sci. 10: 221-247 (1980)

Dexter Kozen: Indexings of Subrecursive Classes. Theor. Comput. Sci. 11: 277-301 (1980)

David Harel, Dexter Kozen, Rohit Parikh: Process Logic: Expressiveness, Decidability, Completeness. FOCS 1980: 129-142

Dexter Kozen: A Representation Theorem for Models of *-Free PDL. ICALP 1980: 351-362

Dexter Kozen: Automata and planar graphs. FCT 1979: 243-254

Dexter Kozen: Semantics of Probabilistic Programs. FOCS 1979: 101-114

Dexter Kozen: On the Duality of Dynamic Algebras and Kripke Models. Logic of Programs 1979: 1-11

Manuel Blum, Dexter Kozen: On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs). FOCS 1978: 132-142

Dexter Kozen: Indexing of Subrecursive Classes. STOC 1978: 287-295

Dexter Kozen: Lower Bounds for Natural Proof Systems. FOCS 1977: 254-266

Dexter Kozen: Complexity of Finitely Presented Algebras. STOC 1977: 164-177

Dexter Kozen: On Parallelism in Turing Machines. FOCS 1976: 89-97