| Publication | Date of Publication | Type |
|---|
| Coalgebraic CTL: fixpoint characterization and polynomial-time model checking | 2025-01-20 | Paper |
| Explicit Hopcroft's trick in categorical partition refinement | 2025-01-20 | Paper |
| A compositional framework for Petri nets | 2025-01-20 | Paper |
| Codensity games for bisimilarity | 2024-12-19 | Paper |
| A compositional approach to parity games | 2024-12-17 | Paper |
| Falsification of hybrid systems using adaptive probabilistic search | 2024-08-08 | Paper |
| Multi-armed bandits for Boolean connectives in hybrid system falsification | 2024-02-16 | Paper |
| Symbolic monitoring against specifications parametric in time and data | 2024-02-16 | Paper |
| Control-data separation and logical condition propagation for efficient inference on probabilistic programs | 2024-02-12 | Paper |
| Online causation monitoring of signal temporal logic | 2024-02-01 | Paper |
| Compositional probabilistic model checking with string diagrams of MDPs | 2024-02-01 | Paper |
| Exploiting adjoints in property directed reachability analysis | 2024-01-12 | Paper |
| Tail probabilities for randomized program runtimes via martingales for higher moments | 2023-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6134267 | 2023-08-21 | Paper |
| Ranking and repulsing supermartingales for reachability in probabilistic programs | 2023-07-28 | Paper |
| Dynamic shielding for reinforcement learning in black-box environments | 2023-06-02 | Paper |
| Sharper and Simpler Nonlinear Interpolants for Program Verification | 2022-12-09 | Paper |
| The Lattice-Theoretic Essence of Property Directed Reachability Analysis | 2022-12-07 | Paper |
| Relational Differential Dynamic Logic | 2022-10-13 | Paper |
| Effective hybrid system falsification using Monte Carlo tree search guided by QB-robustness | 2022-03-25 | Paper |
| Decision tree learning in CEGIS-based termination analysis | 2022-03-25 | Paper |
| Architecture-guided test resource allocation via logic | 2022-03-21 | Paper |
| Fibrational bisimulations and quantitative reasoning: Extended version | 2021-10-21 | Paper |
| Coalgebraic Theory of Büchi and Parity Automata: Fixed-Point Specifications, Categorically (Invited Tutorial). | 2021-08-04 | Paper |
| Near-Optimal Scheduling for LTL with Future Discounting | 2021-04-07 | Paper |
| Widest paths and global propagation in bounded value iteration for stochastic games | 2021-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144699 | 2021-01-19 | Paper |
| Path category for free. Open morphisms from coalgebras with non-deterministic branching | 2020-01-28 | Paper |
| Moore-machine filtering for timed and untimed pattern matching | 2019-10-22 | Paper |
| Relational differential dynamic logic | 2019-10-22 | Paper |
| Fibrational bisimulations and quantitative reasoning | 2018-10-23 | Paper |
| Categorical Büchi and parity conditions via alternating fixed points of functors | 2018-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4585069 | 2018-09-06 | Paper |
| Parity Automata for Quantitative Linear Time Logics | 2018-08-13 | Paper |
| The geometry of synchronization | 2018-04-23 | Paper |
| Memoryful geometry of interaction | 2018-04-23 | Paper |
| Healthiness from Duality | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608676 | 2018-03-21 | Paper |
| Coinductive predicates and final sequences in a fibration | 2018-03-09 | Paper |
| Time robustness in MTL and expressivity in hybrid system falsification | 2018-03-01 | Paper |
| A Boyer-Moore Type Algorithm for Timed Pattern Matching | 2018-02-16 | Paper |
| Efficient online timed pattern matching by automata-based skipping | 2017-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5367059 | 2017-10-12 | Paper |
| Coalgebraic Infinite Traces and Kleisli Simulations | 2017-07-11 | Paper |
| Quantitative simulations by matrices | 2016-12-22 | Paper |
| Semantics of higher-order quantum computation via geometry of interaction | 2016-12-02 | Paper |
| Memoryful geometry of interaction. II: Recursion and adequacy | 2016-10-24 | Paper |
| Lattice-theoretic progress measures and coalgebraic model checking | 2016-10-24 | Paper |
| Coalgebraic Representation Theory of Fractals | 2016-07-08 | Paper |
| Coinductive predicates and final sequences in a fibration | 2016-04-12 | Paper |
| Abstract Interpretation with Infinitesimals | 2016-03-23 | Paper |
| Generic weakest precondition semantics from monads enriched with order | 2015-11-10 | Paper |
| Generic Weakest Precondition Semantics from Monads Enriched with Order | 2015-09-11 | Paper |
| Hyperstream processing systems | 2014-11-27 | Paper |
| Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices | 2014-09-15 | Paper |
| Measurements in Proof Nets as Higher-Order Quantum Circuits | 2014-04-16 | Paper |
| Generic trace theory | 2013-12-04 | Paper |
| Categorifying computations into components via arrows as profunctors | 2012-10-02 | Paper |
| Coalgebraic Components in a Many-Sorted Microcosm | 2012-06-01 | Paper |
| The Microcosm Principle and Compositionality of GSOS-Based Component Calculi | 2011-09-02 | Paper |
| Programming with Infinitesimals: A While-Language for Hybrid System Modeling | 2011-07-07 | Paper |
| Traces for coalgebraic components | 2011-06-10 | Paper |
| Generic Forward and Backward Simulations II: Probabilistic Simulation | 2010-08-31 | Paper |
| Probabilistic anonymity via coalgebraic simulations | 2010-05-27 | Paper |
| Categorical semantics for arrows | 2009-10-28 | Paper |
| Relations Among Notions of Security for Identity Based Encryption Schemes | 2008-09-18 | Paper |
| The Microcosm Principle and Concurrency in Coalgebra | 2008-04-11 | Paper |
| Generic Trace Semantics via Coinduction | 2008-04-01 | Paper |
| Categorical Views on Computations on Trees (Extended Abstract) | 2007-11-28 | Paper |
| Generic Forward and Backward Simulations | 2007-09-04 | Paper |
| Probabilistic Anonymity Via Coalgebraic Simulations | 2007-09-04 | Paper |
| Algebra and Coalgebra in Computer Science | 2006-10-20 | Paper |
| Kripke Completeness of First-Order Constructive Logics with Strong Negation | 2004-05-27 | Paper |
