| Publication | Date of Publication | Type |
|---|
Joint distributions in probabilistic semantics
| 2026-04-02 | Paper |
Guarded Kleene algebra with tests: automata learning
| 2026-04-02 | Paper |
On star expressions and completeness theorems
| 2024-12-17 | Paper |
Canonical automata via distributive law homomorphisms
| 2024-12-17 | Paper |
Generators and bases for monadic closures
| 2024-11-26 | Paper |
Probabilistic guarded KAT Modulo bisimilarity: completeness and complexity
| 2024-11-14 | Paper |
Minimisation in logical form
| 2024-10-01 | Paper |
Processes parametrised by an algebraic theory
| 2024-06-24 | Paper |
Symbolic semantics for probabilistic programs
| 2024-05-29 | Paper |
Symbolic register automata
Computer Aided Verification | 2024-02-16 | Paper |
scientific article; zbMATH DE number 7774251 (Why is no real title available?)
| 2023-12-08 | Paper |
A complete inference system for skip-free guarded Kleene algebra with tests
| 2023-11-24 | Paper |
Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks
Programming Languages and Systems | 2023-08-03 | Paper |
scientific article; zbMATH DE number 7649889 (Why is no real title available?)
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7649949 (Why is no real title available?)
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650303 (Why is no real title available?)
| 2023-02-03 | Paper |
A categorical framework for learning generalised tree automata
| 2022-12-07 | Paper |
scientific article; zbMATH DE number 7561600 (Why is no real title available?)
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561646 (Why is no real title available?)
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559476 (Why is no real title available?)
| 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559448 (Why is no real title available?)
| 2022-07-18 | Paper |
CONCUR Test-of-time award 2020 announcement
| 2022-07-18 | Paper |
Borel kernels and their approximation, categorically
| 2022-05-03 | Paper |
Hennessy-Milner results for probabilistic PDL
| 2022-04-29 | Paper |
Formalizing Moessner's theorem and generalizations in \textsc{Nuprl}
Journal of Logical and Algebraic Methods in Programming | 2021-11-24 | Paper |
Learning pomset automata
| 2021-10-18 | Paper |
scientific article; zbMATH DE number 7407791 (Why is no real title available?)
| 2021-10-08 | Paper |
Distribution bisimilarity via the power of convex algebras
| 2021-10-08 | Paper |
scientific article; zbMATH DE number 7376040 (Why is no real title available?)
| 2021-07-28 | Paper |
Learning to coordinate
| 2021-06-03 | Paper |
Moessner's theorem: an exercise in coinductive reasoning in \textsc{Coq}
| 2021-05-20 | Paper |
SDN-actors: modeling and verification of SDN programs
| 2021-05-04 | Paper |
Actor-based model checking for software-defined networks
Journal of Logical and Algebraic Methods in Programming | 2021-02-26 | Paper |
Learning automata with side-effects
| 2021-02-22 | Paper |
Semantics of Probabilistic Programming: A Gentle Introduction
Foundations of Probabilistic Programming | 2021-02-16 | Paper |
Learning weighted automata over principal ideal domains
| 2020-09-23 | Paper |
Concurrent Kleene algebra with observations: from hypotheses to completeness
| 2020-09-23 | Paper |
Toward a uniform theory of effectful state machines
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
scientific article; zbMATH DE number 7204940 (Why is no real title available?)
| 2020-05-27 | Paper |
Brzozowski goes concurrent -- a Kleene theorem for pomset languages
| 2020-05-27 | Paper |
CALF: categorical automata learning framework
| 2020-05-26 | Paper |
Completeness and incompleteness of synchronous Kleene algebra
| 2020-05-05 | Paper |
Left-handed completeness
Theoretical Computer Science | 2020-01-22 | Paper |
Preservation of Equations by Monoidal Monads
| 2020-01-17 | Paper |
Proceedings Fifth Interaction and Concurrency Experience
Electronic Proceedings in Theoretical Computer Science | 2020-01-08 | Paper |
Concurrent Kleene algebra: free model and completeness
| 2019-09-13 | Paper |
A (co)algebraic theory of succinct automata
Journal of Logical and Algebraic Methods in Programming | 2019-06-20 | Paper |
On series-parallel pomset languages: rationality, context-freeness and automata
Journal of Logical and Algebraic Methods in Programming | 2019-03-27 | Paper |
Position Automata for Kleene Algebra with Tests
Scientific Annals of Computer Science | 2019-02-08 | Paper |
Convex language semantics for nondeterministic probabilistic automata
| 2018-11-23 | Paper |
Layer by layer -- combining monads
| 2018-11-23 | Paper |
A compositional model to reason about end-to-end QoS in stochastic Reo connectors
Science of Computer Programming | 2018-07-16 | Paper |
scientific article; zbMATH DE number 6864542 (Why is no real title available?)
| 2018-04-25 | Paper |
Coinductive foundations of infinitary rewriting and infinitary equational logic
| 2018-01-12 | Paper |
CoCaml: functional programming with regular coinductive types
Fundamenta Informaticae | 2017-11-10 | Paper |
Cantor meets Scott: semantic foundations for probabilistic networks
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages | 2017-10-20 | Paper |
Learning nominal automata
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages | 2017-10-20 | Paper |
Enhanced coalgebraic bisimulation
| 2017-09-27 | Paper |
Practical coinduction
Mathematical Structures in Computer Science | 2017-09-27 | Paper |
Well-founded coalgebras, revisited
Mathematical Structures in Computer Science | 2017-09-27 | Paper |
Completeness and incompleteness in nominal Kleene algebra
Journal of Logical and Algebraic Methods in Programming | 2017-08-31 | Paper |
A coinductive framework for infinitary rewriting and equational reasoning
| 2017-07-12 | Paper |
A coalgebraic view on decorated traces
Mathematical Structures in Computer Science | 2017-04-03 | Paper |
A tribute to José Nuno Oliveira
Journal of Logical and Algebraic Methods in Programming | 2016-12-15 | Paper |
A coalgebraic decision procedure for NetKAT
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
Sound and complete axiomatization of trace semantics for probabilistic systems
Electronic Notes in Theoretical Computer Science | 2016-07-15 | Paper |
Final semantics for decorated traces
Electronic Notes in Theoretical Computer Science | 2016-07-08 | Paper |
Probabilistic NetKAT
Programming Languages and Systems | 2016-04-26 | Paper |
Completeness and incompleteness in nominal Kleene algebra
Relational and Algebraic Methods in Computer Science | 2016-01-08 | Paper |
Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
Theoretical Computer Science | 2015-11-10 | Paper |
Nominal Kleene coalgebra
Automata, Languages, and Programming | 2015-11-04 | Paper |
Sound and complete axiomatizations of coalgebraic language equivalence
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
How to Kill Epsilons with a Dagger
Advanced Information Systems Engineering | 2015-09-11 | Paper |
Trace semantics via determinization
Journal of Computer and System Sciences | 2015-04-28 | Paper |
Brzozowski's and up-to algorithms for must testing
Programming Languages and Systems | 2015-01-12 | Paper |
Towards a Coalgebraic Chomsky Hierarchy
Advanced Information Systems Engineering | 2014-09-15 | Paper |
Automata Learning: A Categorical Perspective
Lecture Notes in Computer Science | 2014-06-02 | Paper |
Initial algebras of terms with binding and algebraic structure
Lecture Notes in Computer Science | 2014-05-08 | Paper |
Algebra-coalgebra duality in Brzozowski's minimization algorithm
ACM Transactions on Computational Logic | 2014-04-16 | Paper |
A coalgebraic view of \(\varepsilon \)-transitions
Algebra and Coalgebra in Computer Science | 2013-09-13 | Paper |
Language constructs for non-well-founded computation
Programming Languages and Systems | 2013-08-05 | Paper |
On Moessner's theorem
The American Mathematical Monthly | 2013-05-28 | Paper |
Generalizing determinization from automata to coalgebras
Logical Methods in Computer Science | 2013-04-09 | Paper |
Left-handed completeness
Relational and Algebraic Methods in Computer Science | 2012-09-21 | Paper |
Trace semantics via determinization
Coalgebraic Methods in Computer Science | 2012-09-20 | Paper |
Generalizing the powerset construction, coalgebraically
| 2012-08-29 | Paper |
A model of context-dependent component connectors
Science of Computer Programming | 2012-07-20 | Paper |
Brzozowski's algorithm (co)algebraically
Logic and Program Semantics | 2012-07-16 | Paper |
A specification language for Reo connectors
Fundamentals of Software Engineering | 2012-06-29 | Paper |
A Coalgebraic Perspective on Minimization and Determinization
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
A coalgebraic perspective on linear weighted automata
Information and Computation | 2012-05-24 | Paper |
A Decision Procedure for Bisimilarity of Generalized Regular Expressions
Lecture Notes in Computer Science | 2011-05-12 | Paper |
Quantitative Kleene coalgebras
Information and Computation | 2011-05-04 | Paper |
Non-deterministic Kleene coalgebras
Logical Methods in Computer Science | 2010-09-21 | Paper |
A coinductive calculus of binary trees
Information and Computation | 2010-04-22 | Paper |
Deriving Syntax and Axioms for Quantitative Regular Behaviours
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
A Kleene Theorem for Polynomial Coalgebras
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
Behavioural Differential Equations and Coinduction for Binary Trees
Logic, Language, Information and Computation | 2009-03-10 | Paper |
Calculating Invariants as Coreflexive Bisimulations
Algebraic Methodology and Software Technology | 2009-01-27 | Paper |
Coalgebraic Logic and Synthesis of Mealy Machines
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
