Остановите войну!
for scientists:
default search action
Dexter Kozen
- > Home > Persons > Dexter Kozen
Publications
- 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) - [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) - 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
- [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 - 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 - [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) - 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
- [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
- [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 - 2006
- [j42]Ruy J. G. B. de Queiroz, Dexter Kozen:
Logic, Language, Information and Computation. Theor. Comput. Sci. 355(2): 105-107 (2006) - [c60]Dexter Kozen, Christoph Kreitz, Eva Richter:
Automating Proofs in Category Theory. IJCAR 2006: 392-407 - 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 - 2003
- [j39]Dexter Kozen, Jerzy Tiuryn:
Substructural logic and partial correctness. ACM Trans. Comput. Log. 4(3): 355-378 (2003) - 2002
- [j38]Robert Givan, David A. McAllester, Carl Witty, Dexter Kozen:
Tarskian Set Constraints. Inf. Comput. 174(2): 105-131 (2002) - 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 - 2000
- [c47]Dexter Kozen, Jerzy Tiuryn:
On the Completeness of Propositional Hoare Logic. RelMiCS 2000: 195-202 - 1998
- [c42]Dexter Kozen, Yaron Minsky, Brian C. Smith:
Efficient Algorithms for Optimal Video Transmission. Data Compression Conference 1998: 229-238 - 1996
- [j28]Dexter Kozen, Susan Landau, Richard Zippel:
Decomposition of Algebraic Functions. J. Symb. Comput. 22(3): 235-246 (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 - 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) - 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 - [c33]Jin-yi Cai, Wolfgang H. J. Fuchs, Dexter Kozen, Zicheng Liu:
Efficient Average-Case Algorithms for the Modular Group. FOCS 1994: 143-152 - [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 - [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
- [c27]Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach:
Efficient Inference of Partial Types. FOCS 1992: 363-371 - 1991
- [c25]Nils Klarlund, Dexter Kozen:
Rabin Measures and Their Applications to Fairness and Automata Theory. LICS 1991: 256-265 - 1990
- [p1]Dexter Kozen, Jerzy Tiuryn:
Logics of Programs. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 789-840 - 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
- [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) - [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) - [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 - [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
- [c15]Dexter Kozen, Rohit Parikh:
A Decision Procedure for the Propositional µ-Calculus. Logic of Programs 1983: 313-325 - 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 - 1981
- [j6]Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer:
Alternation. J. ACM 28(1): 114-133 (1981) - [j4]Dexter Kozen, Rohit Parikh:
An Elementary Proof of the Completness of PDL. Theor. Comput. Sci. 14: 113-118 (1981) - 1980
- [c10]David Harel, Dexter Kozen, Rohit Parikh:
Process Logic: Expressiveness, Decidability, Completeness. FOCS 1980: 129-142 - 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
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 2024-04-09 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint