| Publication | Date of Publication | Type |
|---|
| Probabilistic guarded KAT Modulo bisimilarity: completeness and complexity | 2024-11-14 | Paper |
| Minimisation in logical form | 2024-10-01 | Paper |
| Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks | 2023-08-03 | Paper |
| Rational spaces and set constraints | 2022-08-18 | Paper |
| The Ackermann Award 2018 | 2022-05-28 | Paper |
| Coalgebraic tools for randomness-conserving protocols | 2022-03-09 | Paper |
| Formalizing Moessner's theorem and generalizations in \textsc{Nuprl} | 2021-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4992897 | 2021-06-10 | Paper |
| Semantics of Probabilistic Programming: A Gentle Introduction | 2021-02-16 | Paper |
| On the Coalgebraic Theory of Kleene Algebra with Tests | 2020-07-27 | Paper |
| Left-handed completeness | 2020-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4972735 | 2019-11-26 | Paper |
| Optimal bounds for the change-making problem | 2019-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4611382 | 2019-01-18 | Paper |
| Coalgebraic tools for randomness-conserving protocols | 2018-11-08 | Paper |
| Coalgebraic Tools for Randomness-Conserving Protocols | 2018-07-07 | Paper |
| KAT + B! | 2018-04-23 | Paper |
| Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes | 2018-04-23 | Paper |
| CoCaml: Functional Programming with Regular Coinductive Types | 2017-11-10 | Paper |
| Infinitary Axiomatization of the Equational Theory of Context-Free Languages | 2017-11-10 | Paper |
| Cantor meets Scott: semantic foundations for probabilistic networks | 2017-10-20 | Paper |
| Practical coinduction | 2017-09-27 | Paper |
| Well-founded coalgebras, revisited | 2017-09-27 | Paper |
| Completeness and incompleteness in nominal Kleene algebra | 2017-08-31 | Paper |
| Stone Duality for Markov Processes | 2017-07-03 | Paper |
| Substructural logic and partial correctness | 2017-06-13 | Paper |
| On Hoare logic and Kleene algebra with tests | 2017-06-13 | Paper |
| A note on the complexity of propositional Hoare logic | 2017-06-13 | Paper |
| Nominal Automata with Name Binding | 2017-05-19 | Paper |
| Capsules and Separation | 2017-05-16 | Paper |
| Kleene Algebra with Products and Iteration Theories | 2017-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5507097 | 2016-12-16 | Paper |
| A coalgebraic decision procedure for NetKAT | 2016-09-29 | Paper |
| Realization of Coinductive Types | 2016-07-15 | Paper |
| New | 2016-07-08 | Paper |
| A metrized duality theorem for Markov processes | 2016-05-13 | Paper |
| Probabilistic NetKAT | 2016-04-26 | Paper |
| NetKAT — A Formal System for the Verification of Networks | 2016-02-26 | Paper |
| Completeness and Incompleteness in Nominal Kleene Algebra | 2016-01-08 | Paper |
| Nominal Kleene Coalgebra | 2015-11-04 | Paper |
| Publication/Citation: A Proof-Theoretic Approach to Mathematical Knowledge Management* | 2015-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5178454 | 2015-03-16 | Paper |
| Kleene Algebra with Equations | 2014-07-01 | Paper |
| Optimal Coin Flipping | 2014-06-02 | Paper |
| Indexing of subrecursive classes | 2014-03-14 | Paper |
| Strong Completeness for Markovian Logics | 2013-09-20 | Paper |
| Language Constructs for Non-Well-Founded Computation | 2013-08-05 | Paper |
| On Moessner’s Theorem | 2013-05-28 | Paper |
| Computing with Capsules | 2012-11-02 | Paper |
| Left-Handed Completeness | 2012-09-21 | Paper |
| Church–Rosser Made Easy | 2011-05-18 | Paper |
| Halting and Equivalence of Program Schemes in Models of Arbitrary Theories | 2010-09-03 | Paper |
| Applications of Metric Coinduction | 2010-01-28 | Paper |
| KAT-ML: an interactive theorem prover for Kleene algebra with tests | 2009-11-30 | Paper |
| Relational Semantics for Higher-Order Programs | 2009-04-02 | Paper |
| Automating Proofs in Category Theory | 2009-03-12 | Paper |
| Applications of Metric Coinduction | 2009-03-10 | Paper |
| The Böhm–Jacopini Theorem Is False, Propositionally | 2008-08-28 | Paper |
| Local variable scoping and Kleene algebra with tests | 2008-06-19 | Paper |
| Local Variable Scoping and Kleene Algebra with Tests | 2008-04-24 | Paper |
| Coinductive Proof Principles for Stochastic Processes | 2008-04-01 | Paper |
| On the Representation of Kleene Algebras with Tests | 2007-09-05 | Paper |
| On the complexity of reasoning in Kleene algebra | 2006-10-10 | Paper |
| Theory of computation. | 2006-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5693581 | 2005-09-26 | Paper |
| Some results in dynamic model theory | 2004-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818830 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808684 | 2004-08-12 | Paper |
| Computational inductive definability | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470486 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437810 | 2003-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428704 | 2003-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789445 | 2003-01-29 | Paper |
| Tarskian set constraints | 2003-01-14 | Paper |
| On the completeness of propositional Hoare logic | 2002-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767087 | 2002-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230360 | 2002-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762494 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4847918 | 2001-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525781 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525271 | 2001-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525285 | 2001-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259978 | 1999-09-07 | Paper |
| Set constraints and logic programming | 1999-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385540 | 1998-05-14 | Paper |
| Computing the Newtonian graph | 1998-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362921 | 1997-11-13 | Paper |
| Decomposition of algebraic functions | 1997-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344149 | 1997-07-14 | Paper |
| Rational spaces and set constraints | 1997-02-27 | Paper |
| Decidability of systems of set constraints with negative constraints | 1995-10-30 | Paper |
| Efficient recursive subtyping | 1995-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4764112 | 1995-05-01 | Paper |
| Efficient inference of partial types | 1994-11-06 | Paper |
| A completeness theorem for Kleene algebras and the algebra of regular events | 1994-06-19 | Paper |
| Optimal bounds for the change-making problem | 1994-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4005203 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4002271 | 1992-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3358736 | 1990-01-01 | Paper |
| Definability with bounded number of bound variables | 1989-01-01 | Paper |
| A finite model theorem for the propositional \(\mu\)-calculus | 1989-01-01 | Paper |
| Polynomial decomposition algorithms | 1989-01-01 | Paper |
| A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots | 1988-01-01 | Paper |
| The complexity of elementary algebra and geometry | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3756408 | 1986-01-01 | Paper |
| A probabilistic PDL | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3732972 | 1985-01-01 | Paper |
| A zero-one law for logic with a fixed-point operator | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3677736 | 1984-01-01 | Paper |
| A programming language for the inductive sets, and applications | 1984-01-01 | Paper |
| Results on the propositional \(\mu\)-calculus | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4744245 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3958436 | 1982-01-01 | Paper |
| Process logic: Expressiveness, decidability, completeness | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3968452 | 1982-01-01 | Paper |
| Alternation | 1981-01-01 | Paper |
| Semantics of probabilistic programs | 1981-01-01 | Paper |
| An elementary proof of the completeness of PDL | 1981-01-01 | Paper |
| Positive First-Order Logic Is NP-Complete | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3939782 | 1981-01-01 | Paper |
| Complexity of Boolean algebras | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3897035 | 1980-01-01 | Paper |
| Indexings of subrecursive classes | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3890117 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4178503 | 1978-01-01 | Paper |
