The following pages link to Jurriaan Rot (Q265818):
Displaying 50 items.
- Rational operational models (Q265819) (← links)
- Structural congruence for bialgebraic semantics (Q338626) (← links)
- A general account of coinduction up-to (Q523132) (← links)
- Proving language inclusion and equivalence by coinduction (Q899321) (← links)
- Verifying OpenJDK's sort method for generic collections (Q1725846) (← links)
- Coalgebraic minimization of automata by initiality and finality (Q1744392) (← links)
- (in)finite trace equivalence of probabilistic transition systems (Q1798789) (← links)
- Steps and traces (Q1798791) (← links)
- Effectively eliminating auxiliaries (Q2026798) (← links)
- Bisimilarity of open terms in stream GSOS (Q2093149) (← links)
- A categorical framework for learning generalised tree automata (Q2104477) (← links)
- Corecursion up-to via causal transformations (Q2104483) (← links)
- Completeness and incompleteness of synchronous Kleene algebra (Q2176687) (← links)
- Learning weighted automata over principal ideal domains (Q2200852) (← links)
- Learning pomset automata (Q2233430) (← links)
- Coalgebra learning via duality (Q2289063) (← links)
- Distributive laws for monotone specifications (Q2329307) (← links)
- Proof pearl: The KeY to correct and stable sorting (Q2351413) (← links)
- On tools for completeness of Kleene algebra with hypotheses (Q2695367) (← links)
- Bounded Model Checking of Recursive Programs with Pointers in K (Q2848871) (← links)
- Automated Verification of Recursive Programs with Pointers (Q2908486) (← links)
- Coalgebraic Bisimulation-Up-To (Q2927660) (← links)
- Unbounded Allocation in Bounded Heaps (Q2948233) (← links)
- Coalgebraic Trace Semantics via Forgetful Logics (Q2948557) (← links)
- Coalgebraic trace semantics via forgetful logics (Q2974794) (← links)
- Companions, Codensity and Causality (Q2988363) (← links)
- Up-to Techniques for Branching Bisimilarity (Q3297777) (← links)
- (Q4580200) (← links)
- Coinduction up-to in a fibrational setting (Q4635603) (← links)
- Coinductive Proof Techniques for Language Equivalence (Q4910486) (← links)
- (Q4986256) (← links)
- (Q5014802) (← links)
- (Q5028440) (← links)
- (Q5089251) (← links)
- (Q5089285) (← links)
- Steps and traces (Q5158368) (← links)
- A Coalgebraic Foundation for Coinductive Union Types (Q5167827) (← links)
- (Q5208779) (← links)
- (Q5228884) (← links)
- Lax Bialgebras and Up-To Techniques for Weak Bisimulations (Q5357707) (← links)
- Enhanced coalgebraic bisimulation (Q5361143) (← links)
- Combining Bialgebraic Semantics and Equations (Q5410685) (← links)
- Duality of Equations and Coequations via Contravariant Adjunctions (Q5739450) (← links)
- Expressive Logics for Coinductive Predicates (Q5874213) (← links)
- Separation and Renaming in Nominal Sets (Q5874218) (← links)
- (Q5875346) (← links)
- (Q5875403) (← links)
- Presenting Distributive Laws (Q5891183) (← links)
- Presenting Distributive Laws (Q5892108) (← links)
- Fast computations on ordered nominal sets (Q5915563) (← links)
