Jurriaan Rot

Orcid: 0000-0002-1404-6232

Affiliations:
  • Radboud University, Nijmegen, The Netherlands


According to our database1, Jurriaan Rot authored at least 70 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Tools for Completeness of Kleene Algebra with Hypotheses.
Log. Methods Comput. Sci., 2024

A Unifying Approach to Product Constructions for Quantitative Temporal Inference.
CoRR, 2024

Pareto Curves for Compositionally Model Checking String Diagrams of MDPs.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

Small Test Suites for Active Automata Learning.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

Composing Codensity Bisimulations.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

State Matching and Multiple References in Adaptive Active Automata Learning.
Proceedings of the Formal Methods - 26th International Symposium, 2024

Proving Behavioural Apartness.
Proceedings of the Coalgebraic Methods in Computer Science, 2024

A Categorical Approach to Coalgebraic Fixpoint Logic.
Proceedings of the Coalgebraic Methods in Computer Science, 2024

Relating Apartness and Branching Bisimulation Games.
Proceedings of the Logics and Type Systems in Theory and Practice, 2024

2023
Preservation and Reflection of Bisimilarity via Invertible Steps.
Proceedings of the Foundations of Software Science and Computation Structures, 2023

Forward and Backward Steps in a Fibration.
Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 2023

Bisimilar States in Uncertain Structures.
Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 2023

2022
Fast computations on ordered nominal sets.
Theor. Comput. Sci., 2022

A New Approach for Active Automata Learning Based on Apartness.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

Processes Parametrised by an Algebraic Theory.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Concurrent NetKAT - Modeling and analyzing stateful, concurrent networks.
Proceedings of the Programming Languages and Systems, 2022

Corecursion Up-to via Causal Transformations.
Proceedings of the Coalgebraic Methods in Computer Science, 2022

A Categorical Framework for Learning Generalised Tree Automata.
Proceedings of the Coalgebraic Methods in Computer Science, 2022

Learning Language Intersections.
Proceedings of the A Journey from Process Algebra via Timed Automata to Model Learning, 2022

2021
Steps and traces.
J. Log. Comput., 2021

Expressive Logics for Coinductive Predicates.
Log. Methods Comput. Sci., 2021

On Star Expressions and Coalgebraic Completeness Theorems.
Proceedings of the Proceedings 37th Conference on Mathematical Foundations of Programming Semantics, 2021

Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Learning Pomset Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

2020
A big step from finite to infinite computations.
Sci. Comput. Program., 2020

Up-to Techniques for Branching Bisimilarity.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Preservation of Equations by Monoidal Monads.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Learning Weighted Automata over Principal Ideal Domains.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

A Big Step from Finite to Infinite Computations (SCICO Journal-first).
Proceedings of the 34th European Conference on Object-Oriented Programming, 2020

Separation and Renaming in Nominal Sets.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

Partially Observable Concurrent Kleene Algebra.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Bisimilarity of open terms in stream GSOS.
Sci. Comput. Program., 2019

Companions, Causality and Codensity.
Log. Methods Comput. Sci., 2019

Verifying OpenJDK's Sort Method for Generic Collections.
J. Autom. Reason., 2019

Completeness and Incompleteness of Synchronous Kleene Algebra.
Proceedings of the Mathematics of Program Construction - 13th International Conference, 2019

Coalgebra Learning via Duality.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

Kleene Algebra with Observations.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

Tree Automata as Algebras: Minimisation and Determinisation.
Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

2018
Coalgebraic Determinization of Alternating Automata.
CoRR, 2018

(In)finite Trace Equivalence of Probabilistic Transition Systems.
Proceedings of the Coalgebraic Methods in Computer Science, 2018

2017
Enhanced coalgebraic bisimulation.
Math. Struct. Comput. Sci., 2017

Distributive Laws for Monotone Specifications.
Proceedings of the Proceedings Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics, 2017

A general account of coinduction up-to.
Acta Informatica, 2017

Bisimilarity of Open Terms in Stream GSOS.
Proceedings of the Fundamentals of Software Engineering - 7th International Conference, 2017

Companions, Codensity and Causality.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

Monoidal Company for Accessible Functors.
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

2016
Verification of Counting Sort and Radix Sort.
Proceedings of the Deductive Software Verification - The KeY Book, 2016

Structural congruence for bialgebraic semantics.
J. Log. Algebraic Methods Program., 2016

Proving language inclusion and equivalence by coinduction.
Inf. Comput., 2016

Coalgebraic Minimization of Automata by Initiality and Finality.
Proceedings of the Thirty-second Conference on the Mathematical Foundations of Programming Semantics, 2016

Coalgebraic trace semantics via forgetful logics.
Log. Methods Comput. Sci., 2016

Duality of Equations and Coequations via Contravariant Adjunctions.
Proceedings of the Coalgebraic Methods in Computer Science, 2016

Effectively Eliminating Auxiliaries.
Proceedings of the Theory and Practice of Formal Methods, 2016

2015
It is pointless to point in bounded heaps.
Sci. Comput. Program., 2015

Model checking recursive programs interacting via the heap.
Sci. Comput. Program., 2015

Presenting Distributive Laws.
Log. Methods Comput. Sci., 2015

Lax Bialgebras and Up-To Techniques for Weak Bisimulations.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

OpenJDK's Java.utils.Collection.sort() Is Broken: The Good, the Bad and the Worst Case.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
Proof Pearl: The KeY to Correct and Stable Sorting.
J. Autom. Reason., 2014

A Coalgebraic Foundation for Coinductive Union Types.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Combining Bialgebraic Semantics and Equations.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

Coinduction up-to in a fibrational setting.
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), 2014

2013
Rational Operational Models.
Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

Coalgebraic Bisimulation-Up-To.
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

Coinductive Proof Techniques for Language Equivalence.
Proceedings of the Language and Automata Theory and Applications, 2013

Unbounded Allocation in Bounded Heaps.
Proceedings of the Fundamentals of Software Engineering - 5th International Conference, 2013

2012
Interacting via the Heap in the Presence of Recursion
Proceedings of the Proceedings Fifth Interaction and Concurrency Experience, 2012

On the specification of operations on the rational behaviour of systems
Proceedings of the Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, 2012

Bounded Model Checking of Recursive Programs with Pointers in K.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2012

Automated Verification of Recursive Programs with Pointers.
Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012


  Loading...