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
- 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 - [i20]Jan Rooduijn, Dexter Kozen, Alexandra Silva:
A cyclic proof system for Guarded Kleene Algebra with Tests (full version). CoRR abs/2405.07505 (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 - [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) - [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]