| 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
ACM Transactions on Modeling and Computer Simulation | 2024-08-08 | Paper |
Multi-armed bandits for Boolean connectives in hybrid system falsification
Computer Aided Verification | 2024-02-16 | Paper |
Symbolic monitoring against specifications parametric in time and data
Computer Aided Verification | 2024-02-16 | Paper |
Control-data separation and logical condition propagation for efficient inference on probabilistic programs
Journal of Logical and Algebraic Methods in Programming | 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
Tools and Algorithms for the Construction and Analysis of Systems | 2023-11-24 | Paper |
scientific article; zbMATH DE number 7730623 (Why is no real title available?)
| 2023-08-21 | Paper |
Ranking and repulsing supermartingales for reachability in probabilistic programs
Automated Technology for Verification and Analysis | 2023-07-28 | Paper |
Dynamic shielding for reinforcement learning in black-box environments
Automated Technology for Verification and Analysis | 2023-06-02 | Paper |
Sharper and Simpler Nonlinear Interpolants for Program Verification
Programming Languages and Systems | 2022-12-09 | Paper |
The Lattice-Theoretic Essence of Property Directed Reachability Analysis
| 2022-12-07 | Paper |
Relational differential dynamic logic
Tools and Algorithms for the Construction and Analysis of Systems | 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
Journal Of Logic And Computation | 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
Trustworthy Global Computing | 2021-04-07 | Paper |
Widest paths and global propagation in bounded value iteration for stochastic games
| 2021-02-09 | Paper |
Categorical liveness checking by corecursive algebras
| 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
Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control | 2019-10-22 | Paper |
Relational differential dynamic logic
Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control | 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 |
Coalgebraic infinite traces and Kleisli simulations
| 2018-09-06 | Paper |
Parity Automata for Quantitative Linear Time Logics
| 2018-08-13 | Paper |
The geometry of synchronization
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Memoryful geometry of interaction: from coalgebraic components to algebraic effects
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Healthiness from Duality
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
scientific article; zbMATH DE number 6851946 (Why is no real title available?)
| 2018-03-21 | Paper |
Coinductive predicates and final sequences in a fibration
Mathematical Structures in Computer Science | 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
Lecture Notes in Computer Science | 2018-02-16 | Paper |
Efficient online timed pattern matching by automata-based skipping
| 2017-12-01 | Paper |
Fair simulation for nondeterministic and probabilistic Büchi automata: a coalgebraic perspective
| 2017-10-12 | Paper |
Coalgebraic Infinite Traces and Kleisli Simulations
| 2017-07-11 | Paper |
Quantitative simulations by matrices
Information and Computation | 2016-12-22 | Paper |
Semantics of higher-order quantum computation via geometry of interaction
Annals of Pure and Applied Logic | 2016-12-02 | Paper |
Memoryful geometry of interaction. II: Recursion and adequacy
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-10-24 | Paper |
Lattice-theoretic progress measures and coalgebraic model checking
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-10-24 | Paper |
Coalgebraic representation theory of fractals
Electronic Notes in Theoretical Computer Science | 2016-07-08 | Paper |
Coinductive predicates and final sequences in a fibration
| 2016-04-12 | Paper |
Abstract interpretation with infinitesimals. Towards scalability in nonstandard static analysis
Lecture Notes in Computer Science | 2016-03-23 | Paper |
Generic weakest precondition semantics from monads enriched with order
Theoretical Computer Science | 2015-11-10 | Paper |
Generic weakest precondition semantics from monads enriched with order
Advanced Information Systems Engineering | 2015-09-11 | Paper |
Hyperstream processing systems, nonstandard modeling of continuous-time signals
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
Generic forward and backward simulations. III: Quantitative simulations by matrices
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Measurements in proof nets as higher-order quantum circuits
Programming Languages and Systems | 2014-04-16 | Paper |
Generic trace theory
| 2013-12-04 | Paper |
Categorifying computations into components via arrows as profunctors
Electronic Notes in Theoretical Computer Science | 2012-10-02 | Paper |
Coalgebraic components in a many-sorted microcosm
Algebra and Coalgebra in Computer Science | 2012-06-01 | Paper |
The Microcosm Principle and Compositionality of GSOS-Based Component Calculi
Algebra and Coalgebra in Computer Science | 2011-09-02 | Paper |
Programming with Infinitesimals: A While-Language for Hybrid System Modeling
Automata, Languages and Programming | 2011-07-07 | Paper |
Traces for coalgebraic components
Mathematical Structures in Computer Science | 2011-06-10 | Paper |
Generic forward and backward simulations. II: Probabilistic simulation
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
Probabilistic anonymity via coalgebraic simulations
Theoretical Computer Science | 2010-05-27 | Paper |
Categorical semantics for arrows
Journal of Functional Programming | 2009-10-28 | Paper |
Relations Among Notions of Security for Identity Based Encryption Schemes
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
The Microcosm Principle and Concurrency in Coalgebra
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
Generic Trace Semantics via Coinduction
Logical Methods in Computer Science | 2008-04-01 | Paper |
Categorical Views on Computations on Trees (Extended Abstract)
Automata, Languages and Programming | 2007-11-28 | Paper |
Generic Forward and Backward Simulations
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Probabilistic Anonymity Via Coalgebraic Simulations
Programming Languages and Systems | 2007-09-04 | Paper |
Algebra and Coalgebra in Computer Science
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Kripke Completeness of First-Order Constructive Logics with Strong Negation
Logic Journal of the IGPL | 2004-05-27 | Paper |
