| 2008 |
|---|
| 113 | EE | Dexter Kozen:
Nonlocal Flow of Control and Kleene Algebra with Tests.
LICS 2008: 105-117 |
| 112 | EE | Dexter Kozen,
Wei-Lung Dustin Tseng:
The Böhm-Jacopini Theorem Is False, Propositionally.
MPC 2008: 177-192 |
| 111 | EE | Kamal Aboul-Hosn,
Dexter Kozen:
Local variable scoping and Kleene algebra with tests.
J. Log. Algebr. Program. 76(1): 3-17 (2008) |
| 2007 |
|---|
| 110 | EE | Dexter Kozen,
Nicholas Ruozzi:
Applications of Metric Coinduction.
CALCO 2007: 327-341 |
| 109 | EE | Daniel Sheldon,
M. A. Saleh Elmohamed,
Dexter Kozen:
Collective Inference on Markov Models for Modeling Bird Migration.
NIPS 2007 |
| 108 | EE | Dexter Kozen:
Coinductive Proof Principles for Stochastic Processes
CoRR abs/0711.0194: (2007) |
| 107 | EE | Dexter Kozen:
Coinductive Proof Principles for Stochastic Processes.
Logical Methods in Computer Science 3(4): (2007) |
| 106 | EE | Dexter Kozen:
Preface.
Sci. Comput. Program. 65(2): 71 (2007) |
| 2006 |
|---|
| 105 | EE | Dexter Kozen,
Christoph Kreitz,
Eva Richter:
Automating Proofs in Category Theory.
IJCAR 2006: 392-407 |
| 104 | EE | Dexter Kozen:
Coinductive Proof Principles for Stochastic Processes.
LICS 2006: 359-366 |
| 103 | EE | Dexter Kozen:
On the Representation of Kleene Algebras with Tests.
MFCS 2006: 73-83 |
| 102 | EE | Kamal Aboul-Hosn,
Dexter Kozen:
Relational Semantics for Higher-Order Programs.
MPC 2006: 29-48 |
| 101 | EE | Kamal Aboul-Hosn,
Dexter Kozen:
Local Variable Scoping and Kleene Algebra with Tests.
RelMiCS 2006: 78-90 |
| 100 | | 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) |
| 99 | EE | Ruy J. G. B. de Queiroz,
Dexter Kozen:
Logic, Language, Information and Computation.
Theor. Comput. Sci. 355(2): 105-107 (2006) |
| 2005 |
|---|
| 98 | EE | 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 |
| 97 | EE | Lucja Kot,
Dexter Kozen:
Kleene Algebra and Bytecode Verification.
Electr. Notes Theor. Comput. Sci. 141(1): 221-236 (2005) |
| 2004 |
|---|
| 96 | | Dexter Kozen,
Carron Shankland:
Mathematics of Program Construction, 7th International Conference, MPC 2004, Stirling, Scotland, UK, July 12-14, 2004, Proceedings
Springer 2004 |
| 95 | EE | Dexter Kozen:
Computational inductive definability.
Ann. Pure Appl. Logic 126(1-3): 139-148 (2004) |
| 94 | EE | Dexter Kozen:
Some results in dynamic model theory.
Sci. Comput. Program. 51(1-2): 3-22 (2004) |
| 2003 |
|---|
| 93 | EE | Matthew Stillerman,
Dexter Kozen:
Efficient Code Certification for Open Firmware.
DISCEX (2) 2003: 147-148 |
| 92 | EE | Dexter Kozen,
Jerzy Tiuryn:
Substructural logic and partial correctness.
ACM Trans. Comput. Log. 4(3): 355-378 (2003) |
| 2002 |
|---|
| 91 | EE | Frank Adelstein,
Matthew Stillerman,
Dexter Kozen:
Malicious Code Detection for Open Firmware.
ACSAC 2002: 403-412 |
| 90 | | Dexter Kozen:
On two letters versus three.
FICS 2002: 44-50 |
| 89 | EE | Dexter Kozen,
Matthew Stillerman:
Eager Class Initialization for Java.
FTRTFT 2002: 71-80 |
| 88 | EE | Dexter Kozen:
Some Results in Dynamic Model Theory.
MPC 2002: 21 |
| 87 | EE | Robert Givan,
David A. McAllester,
Carl Witty,
Dexter Kozen:
Tarskian Set Constraints.
Inf. Comput. 174(2): 105-131 (2002) |
| 86 | EE | Dexter Kozen:
On the Complexity of Reasoning in Kleene Algebra.
Inf. Comput. 179(2): 152-162 (2002) |
| 2001 |
|---|
| 85 | | Dexter Kozen,
Jerzy Tiuryn:
Intuitionistic Linear Logic and Partial Correctness.
LICS 2001: 259-268 |
| 84 | EE | Dexter Kozen:
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra.
STACS 2001: 27-38 |
| 83 | | Dexter Kozen,
Jerzy Tiuryn:
On the completeness of propositional Hoare logic.
Inf. Sci. 139(3-4): 187-195 (2001) |
| 2000 |
|---|
| 82 | EE | Dexter Kozen,
Maria-Christina Patron:
Certification of Compiler Optimizations Using Kleene Algebra with Tests.
Computational Logic 2000: 568-582 |
| 81 | | Dexter Kozen,
Jerzy Tiuryn:
On the Completeness of Propositional Hoare Logic.
RelMiCS 2000: 195-202 |
| 80 | EE | Ernie Cohen,
Dexter Kozen:
A note on the complexity of propositional Hoare logic.
ACM Trans. Comput. Log. 1(1): 171-174 (2000) |
| 79 | EE | Dexter Kozen:
On Hoare logic and Kleene algebra with tests.
ACM Trans. Comput. Log. 1(1): 60-76 (2000) |
| 1999 |
|---|
| 78 | EE | Dexter Kozen:
On Hoare Logic and Kleene Algebra with Tests.
LICS 1999: 167-172 |
| 77 | EE | Mark W. Hopkins,
Dexter Kozen:
Parikh's Theorem in Commutative Kleene Algebra.
LICS 1999: 394-401 |
| 76 | | Dexter Kozen:
Language-Based Security.
MFCS 1999: 284-298 |
| 1998 |
|---|
| 75 | EE | Dexter Kozen,
Yaron Minsky,
Brian C. Smith:
Efficient Algorithms for Optimal Video Transmission.
Data Compression Conference 1998: 229-238 |
| 74 | | Dexter Kozen:
Set Constraints and Logic Programming.
Inf. Comput. 142(1): 2-25 (1998) |
| 1997 |
|---|
| 73 | EE | Dexter Kozen:
On the Complexity of Reasoning in Kleene Algebra.
LICS 1997: 195-202 |
| 72 | EE | Dexter Kozen:
Kleene Algebra with Tests.
ACM Trans. Program. Lang. Syst. 19(3): 427-443 (1997) |
| 71 | | Dexter Kozen,
Kjartan Stefánsson:
Computing the Newtonian Graph.
J. Symb. Comput. 24(2): 125-136 (1997) |
| 1996 |
|---|
| 70 | | Dexter Kozen,
Frederick Smith:
Kleene Algebra with Tests: Completeness and Decidability.
CSL 1996: 244-259 |
| 69 | | Allan Cheng,
Dexter Kozen:
A Complete Gentzen-Style Axiomatization for Set Constraints.
ICALP 1996: 134-145 |
| 68 | | David A. McAllester,
Robert Givan,
Carl Witty,
Dexter Kozen:
Tarskian Set Constraints.
LICS 1996: 138-147 |
| 67 | | Dexter Kozen:
Kleene Algebra withTests and Commutativity Conditions.
TACAS 1996: 14-33 |
| 66 | | Dexter Kozen:
On Regularity-Preserving Functions.
Bulletin of the EATCS 58: (1996) |
| 65 | | Dexter Kozen,
Susan Landau,
Richard Zippel:
Decomposition of Algebraic Functions.
J. Symb. Comput. 22(3): 235-246 (1996) |
| 64 | EE | Dexter Kozen:
Rational Spaces and Set Constraints.
Theor. Comput. Sci. 167(1&2): 73-94 (1996) |
| 1995 |
|---|
| 63 | | Dexter Kozen:
Rational Spaces and Set Constraints.
TAPSOFT 1995: 42-61 |
| 62 | EE | Nils Klarlund,
Dexter Kozen:
Rabin Measures.
Chicago J. Theor. Comput. Sci. 1995: (1995) |
| 61 | | Alexander Aiken,
Dexter Kozen,
Edward L. Wimmers:
Decidability of Systems of Set Constraints with Negative Constraints
Inf. Comput. 122(1): 30-44 (1995) |
| 60 | | Dexter Kozen,
Jens Palsberg,
Michael I. Schwartzbach:
Efficient Recursive Subtyping.
Mathematical Structures in Computer Science 5(1): 113-125 (1995) |
| 1994 |
|---|
| 59 | | Dexter Kozen,
Susan Landau,
Richard Zippel:
Decomposition of algebraic functions.
ANTS 1994: 80-92 |
| 58 | | Dexter Kozen:
Set Constraints and Logic Programming.
CCL 1994: 302-303 |
| 57 | | Jin-yi Cai,
Wolfgang H. J. Fuchs,
Dexter Kozen,
Zicheng Liu:
Efficient Average-Case Algorithms for the Modular Group
FOCS 1994: 143-152 |
| 56 | | Dexter Kozen:
Efficient Resolution of Singularities of Plane Curves.
FSTTCS 1994: 1-11 |
| 55 | EE | 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) |
| 54 | | Dexter Kozen:
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
Inf. Comput. 110(2): 366-390 (1994) |
| 53 | | Dexter Kozen,
Jens Palsberg,
Michael I. Schwartzbach:
Efficient Inference of Partial Types.
J. Comput. Syst. Sci. 49(2): 306-324 (1994) |
| 52 | | Dexter Kozen,
Shmuel Zaks:
Optimal Bounds for the Change-Making Problem.
Theor. Comput. Sci. 123(2): 377-388 (1994) |
| 1993 |
|---|
| 51 | | Alexander Aiken,
Dexter Kozen,
Moshe Y. Vardi,
Edward L. Wimmers:
The Complexity of Set Constraints.
CSL 1993: 1-17 |
| 50 | | Dexter Kozen:
Logical Aspects of Set Constraints.
CSL 1993: 175-188 |
| 49 | | Dexter Kozen,
Shmuel Zaks:
Optimal Bounds for the Change-Making Problem.
ICALP 1993: 150-161 |
| 48 | | Dexter Kozen,
Jens Palsberg,
Michael I. Schwartzbach:
Efficient Recursive Subtyping.
POPL 1993: 419-428 |
| 1992 |
|---|
| 47 | | Dexter Kozen,
Jens Palsberg,
Michael I. Schwartzbach:
Efficient Inference of Partial Types
FOCS 1992: 363-371 |
| 46 | | Dexter Kozen:
On the Myhill-Nerode theorem theorem for trees.
Bulletin of the EATCS 47: 170-173 (1992) |
| 1991 |
|---|
| 45 | | Dexter Kozen:
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
LICS 1991: 214-225 |
| 44 | | Nils Klarlund,
Dexter Kozen:
Rabin Measures and Their Applications to Fairness and Automata Theory
LICS 1991: 256-265 |
| 1990 |
|---|
| 43 | | Dexter Kozen:
On Kleene Algebras and Closed Semirings.
MFCS 1990: 26-47 |
| 42 | | Dexter Kozen,
Jerzy Tiuryn:
Logics of Programs.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 789-840 |
| 1989 |
|---|
| 41 | | Neil Immerman,
Dexter Kozen:
Definability with Bounded Number of Bound Variables
Inf. Comput. 83(2): 121-139 (1989) |
| 40 | | Dexter Kozen,
Susan Landau:
Polynomial Decomposition Algorithms.
J. Symb. Comput. 7(5): 445-456 (1989) |
| 1988 |
|---|
| 39 | | 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 |
|---|
| 38 | | Joachim von zur Gathen,
Dexter Kozen,
Susan Landau:
Functional Decomposition of Polynomials
FOCS 1987: 127-131 |
| 37 | | Neil Immerman,
Dexter Kozen:
Definability with Bounded Number of Bound Variables
LICS 1987: 236-244 |
| 1986 |
|---|
| 36 | | 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 |
| 35 | | Krzysztof R. Apt,
Dexter Kozen:
Limits for Automatic Verification of Finite-State Concurrent Systems.
Inf. Process. Lett. 22(6): 307-309 (1986) |
| 34 | | Michael Ben-Or,
Dexter Kozen,
John H. Reif:
The Complexity of Elementary Algebra and Geometry.
J. Comput. Syst. Sci. 32(2): 251-264 (1986) |
| 1985 |
|---|
| 33 | | Dexter Kozen,
Chee-Keng Yap:
Algebraic Cell Decomposition in NC (Preliminary Version)
FOCS 1985: 515-521 |
| 32 | | 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 |
| 31 | | 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) |
| 30 | | Dexter Kozen:
A Probabilistic PDL.
J. Comput. Syst. Sci. 30(2): 162-178 (1985) |
| 1984 |
|---|
| 29 | | Edmund M. Clarke,
Dexter Kozen:
Logics of Programs, Workshop, Carnegie Mellon University, Pittsburgh, PA, USA, June 6-8, 1983, Proceedings
Springer 1984 |
| 28 | | Nissim Francez,
Dexter Kozen:
Generalized Fair Termination.
POPL 1984: 46-53 |
| 27 | | Dexter Kozen:
Pebblings, Edgings, and Equational Logic
STOC 1984: 428-435 |
| 26 | | Michael Ben-Or,
Dexter Kozen,
John H. Reif:
The Complexity of Elementary Algebra and Geometry (Preliminary Abstract)
STOC 1984: 457-464 |
| 25 | | David Harel,
Dexter Kozen:
A Programming Language for the Inductive Sets, and Applications
Information and Control 63(1/2): 118-139 (1984) |
| 1983 |
|---|
| 24 | | Dexter Kozen,
Rohit Parikh:
A Decision Procedure for the Propositional µ-Calculus.
Logic of Programs 1983: 313-325 |
| 23 | | Dexter Kozen:
A Probabilistic PDL
STOC 1983: 291-297 |
| 22 | | Dexter Kozen:
Results on the Propositional mu-Calculus.
Theor. Comput. Sci. 27: 333-354 (1983) |
| 1982 |
|---|
| 21 | | Dexter Kozen:
Logics of Programs, Workshop, Yorktown Heights, New York, May 1981
Springer 1982 |
| 20 | | David Harel,
Dexter Kozen:
A Programming Language for the Inductive Sets, and Applications.
ICALP 1982: 313-329 |
| 19 | | Dexter Kozen:
Results on the Propositional µ-Calculus.
ICALP 1982: 348-359 |
| 18 | | David Harel,
Dexter Kozen,
Rohit Parikh:
Process Logic: Expressiveness, Decidability, Completeness.
J. Comput. Syst. Sci. 25(2): 144-170 (1982) |
| 1981 |
|---|
| 17 | | Dexter Kozen:
On Induction vs. *-Continuity.
Logic of Programs 1981: 167-176 |
| 16 | | Dexter Kozen:
Communication: Positive First-Order Logic is NP-Complete.
IBM Journal of Research and Development 25(4): 327-332 (1981) |
| 15 | EE | Ashok K. Chandra,
Dexter Kozen,
Larry J. Stockmeyer:
Alternation.
J. ACM 28(1): 114-133 (1981) |
| 14 | | Dexter Kozen:
Semantics of Probabilistic Programs.
J. Comput. Syst. Sci. 22(3): 328-350 (1981) |
| 13 | | Dexter Kozen,
Rohit Parikh:
An Elementary Proof of the Completness of PDL.
Theor. Comput. Sci. 14: 113-118 (1981) |
| 1980 |
|---|
| 12 | | David Harel,
Dexter Kozen,
Rohit Parikh:
Process Logic: Expressiveness, Decidability, Completeness
FOCS 1980: 129-142 |
| 11 | | Dexter Kozen:
A Representation Theorem for Models of *-Free PDL.
ICALP 1980: 351-362 |
| 10 | | Dexter Kozen:
Complexity of Boolean Algebras.
Theor. Comput. Sci. 10: 221-247 (1980) |
| 9 | | Dexter Kozen:
Indexings of Subrecursive Classes.
Theor. Comput. Sci. 11: 277-301 (1980) |
| 1979 |
|---|
| 8 | | Dexter Kozen:
Automata and planar graphs.
FCT 1979: 243-254 |
| 7 | | Dexter Kozen:
Semantics of Probabilistic Programs
FOCS 1979: 101-114 |
| 6 | | Dexter Kozen:
On the Duality of Dynamic Algebras and Kripke Models.
Logic of Programs 1979: 1-11 |
| 1978 |
|---|
| 5 | | Manuel Blum,
Dexter Kozen:
On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs)
FOCS 1978: 132-142 |
| 4 | | Dexter Kozen:
Indexing of Subrecursive Classes
STOC 1978: 287-295 |
| 1977 |
|---|
| 3 | | Dexter Kozen:
Lower Bounds for Natural Proof Systems
FOCS 1977: 254-266 |
| 2 | | Dexter Kozen:
Complexity of Finitely Presented Algebras
STOC 1977: 164-177 |
| 1976 |
|---|
| 1 | | Dexter Kozen:
On Parallelism in Turing Machines
FOCS 1976: 89-97 |
