| A Categorical Framework for Learning Generalised Tree Automata. | 0 | 0.34 | 2022 |
| Steps and traces | 0 | 0.34 | 2021 |
| EXPRESSIVE LOGICS FOR COINDUCTIVE PREDICATES | 0 | 0.34 | 2021 |
| A Big Step from Finite to Infinite Computations | 0 | 0.34 | 2020 |
| Expressive Logics for Coinductive Predicates. | 0 | 0.34 | 2020 |
| A Big Step from Finite to Infinite Computations (SCICO Journal-first). | 0 | 0.34 | 2020 |
| Partially Observable Concurrent Kleene Algebra | 0 | 0.34 | 2020 |
| Preservation of Equations by Monoidal Monads | 0 | 0.34 | 2020 |
| Learning Weighted Automata over Principal Ideal Domains | 0 | 0.34 | 2020 |
| Completeness and Incompleteness of Synchronous Kleene Algebra. | 0 | 0.34 | 2019 |
| Tree Automata as Algebras: Minimisation and Determinisation. | 0 | 0.34 | 2019 |
| Coalgebra Learning via Duality. | 0 | 0.34 | 2019 |
| Separation and Renaming in Nominal Sets. | 0 | 0.34 | 2019 |
| Verifying OpenJDK's Sort Method for Generic Collections. | 2 | 0.36 | 2019 |
| Kleene Algebra with Observations. | 0 | 0.34 | 2018 |
| Bisimilarity of Open Terms in Stream GSOS. | 0 | 0.34 | 2018 |
| Coalgebraic Determinization of Alternating Automata. | 1 | 0.36 | 2018 |
| Enhanced coalgebraic bisimulation. | 0 | 0.34 | 2017 |
| Companions, Causality and Codensity. | 0 | 0.34 | 2017 |
| Monoidal Company for Accessible Functors. | 0 | 0.34 | 2017 |
| Companions, Codensity and Causality. | 1 | 0.36 | 2017 |
| A general account of coinduction up-to. | 6 | 0.46 | 2017 |
| Distributive Laws for Monotone Specifications. | 0 | 0.34 | 2017 |
| Proving language inclusion and equivalence by coinduction. | 3 | 0.39 | 2016 |
| Effectively Eliminating Auxiliaries. | 0 | 0.34 | 2016 |
| Coalgebraic Minimization of Automata by Initiality and Finality. | 0 | 0.34 | 2016 |
| Duality Of Equations And Coequations Via Contravariant Adjunctions | 1 | 0.37 | 2016 |
| Structural congruence for bialgebraic semantics. | 0 | 0.34 | 2016 |
| Lax Bialgebras and Up-To Techniques for Weak Bisimulations | 2 | 0.37 | 2015 |
| Coalgebraic Trace Semantics via Forgetful Logics. | 6 | 0.62 | 2015 |
| It is pointless to point in bounded heaps | 0 | 0.34 | 2015 |
| Presenting Distributive Laws | 5 | 0.55 | 2015 |
| Openjdk'S Java.Utils.Collection.Sort() Is Broken: The Good, The Bad And The Worst Case | 14 | 0.87 | 2015 |
| Model checking recursive programs interacting via the heap. | 1 | 0.36 | 2015 |
| A Coalgebraic Foundation for Coinductive Union Types. | 2 | 0.38 | 2014 |
| Coinduction up-to in a fibrational setting | 16 | 0.66 | 2014 |
| Proof Pearl: The KeY to Correct and Stable Sorting | 4 | 0.50 | 2014 |
| Combining Bialgebraic Semantics and Equations. | 3 | 0.41 | 2014 |
| Rational Operational Models | 0 | 0.34 | 2013 |
| Presenting Distributive Laws. | 1 | 0.37 | 2013 |
| Coinductive Proof Techniques for Language Equivalence. | 5 | 0.43 | 2013 |
| Unbounded Allocation in Bounded Heaps. | 3 | 0.37 | 2013 |
| Coalgebraic Bisimulation-Up-To. | 14 | 0.64 | 2013 |
| On The Specification Of Operations On The Rational Behaviour Of Systems | 2 | 0.37 | 2012 |
| Interacting Via The Heap In The Presence Of Recursion | 6 | 0.45 | 2012 |
| Automated verification of recursive programs with pointers | 5 | 0.43 | 2012 |
| Bounded Model Checking of Recursive Programs with Pointers in K. | 1 | 0.35 | 2012 |
