default search action
Jurriaan Rot
Person information
- affiliation: Radboud University, Nijmegen, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j18]Damien Pous, Jurriaan Rot, Jana Wagemaker:
On Tools for Completeness of Kleene Algebra with Hypotheses. Log. Methods Comput. Sci. 20(2) (2024) - [c56]Jurriaan Rot, Sebastian Junges, Harsh Beohar:
Relating Apartness and Branching Bisimulation Games. Logics and Type Systems in Theory and Practice 2024: 203-213 - [c55]Ezra Schoen, Clemens Kupke, Jurriaan Rot, Ruben Turkenburg:
A Categorical Approach to Coalgebraic Fixpoint Logic. CMCS 2024: 23-43 - [c54]Ruben Turkenburg
, Harsh Beohar
Proving Behavioural Apartness. CMCS 2024: 156-173 - [c53]Loes Kruger
State Matching and Multiple References in Adaptive Active Automata Learning. FM (1) 2024: 267-284 - [c52]Mayuko Kori
Composing Codensity Bisimulations. LICS 2024: 52:1-52:13 - [c51]Loes Kruger
Small Test Suites for Active Automata Learning. TACAS (2) 2024: 109-129 - [c50]Kazuki Watanabe, Marck van der Vegt, Ichiro Hasuo, Jurriaan Rot, Sebastian Junges:
Pareto Curves for Compositionally Model Checking String Diagrams of MDPs. TACAS (2) 2024: 279-298 - [i31]Kazuki Watanabe, Marck van der Vegt, Ichiro Hasuo, Jurriaan Rot, Sebastian Junges:
Pareto Curves for Compositionally Model Checking String Diagrams of MDPs. CoRR abs/2401.08377 (2024) - [i30]Loes Kruger, Sebastian Junges, Jurriaan Rot:
Small Test Suites for Active Automata Learning. CoRR abs/2401.12703 (2024) - [i29]Mayuko Kori, Kazuki Watanabe, Jurriaan Rot, Shin-ya Katsumata:
Composing Codensity Bisimulations. CoRR abs/2404.08308 (2024) - [i28]Ruben Turkenburg, Harsh Beohar, Clemens Kupke, Jurriaan Rot:
Proving Behavioural Apartness. CoRR abs/2404.16588 (2024) - [i27]Ezra Schoen, Clemens Kupke, Jurriaan Rot, Ruben Turkenburg:
A Categorical Approach to Coalgebraic Fixpoint Logic. CoRR abs/2405.00237 (2024) - [i26]Loes Kruger, Sebastian Junges, Jurriaan Rot:
State Matching and Multiple References in Adaptive Active Automata Learning. CoRR abs/2406.19714 (2024) - [i25]Kazuki Watanabe, Sebastian Junges, Jurriaan Rot, Ichiro Hasuo:
A Unifying Approach to Product Constructions for Quantitative Temporal Inference. CoRR abs/2407.10465 (2024) - 2023
- [c49]Ruben Turkenburg, Harsh Beohar, Clemens Kupke, Jurriaan Rot:
Forward and Backward Steps in a Fibration. CALCO 2023: 6:1-6:18 - [c48]Jurriaan Rot, Thorsten Wißmann:
Bisimilar States in Uncertain Structures. CALCO 2023: 12:1-12:17 - [c47]Ruben Turkenburg
Preservation and Reflection of Bisimilarity via Invertible Steps. FoSSaCS 2023: 328-348 - [i24]Jurriaan Rot, Thorsten Wißmann:
Bisimilar States in Uncertain Structures. CoRR abs/2303.15279 (2023) - 2022
- [j17]David Venhoek, Joshua Moerman
Fast computations on ordered nominal sets. Theor. Comput. Sci. 935: 82-104 (2022) - [c46]Sebastian Junges
Learning Language Intersections. A Journey from Process Algebra via Timed Automata to Model Learning 2022: 371-381 - [c45]Gerco van Heerdt
A Categorical Framework for Learning Generalised Tree Automata. CMCS 2022: 67-87 - [c44]Damien Pous
Corecursion Up-to via Causal Transformations. CMCS 2022: 133-154 - [c43]Jana Wagemaker
Concurrent NetKAT - Modeling and analyzing stateful, concurrent networks. ESOP 2022: 575-602 - [c42]Todd Schmid
Processes Parametrised by an Algebraic Theory. ICALP 2022: 132:1-132:20 - [c41]Frits W. Vaandrager
A New Approach for Active Automata Learning Based on Apartness. TACAS (1) 2022: 223-243 - [i23]Jana Wagemaker, Nate Foster, Tobias Kappé, Dexter Kozen, Jurriaan Rot, Alexandra Silva:
Concurrent NetKAT: Modeling and analyzing stateful, concurrent networks. CoRR abs/2201.10485 (2022) - [i22]Todd Schmid, Wojciech Rozowski, Alexandra Silva, Jurriaan Rot:
Processes Parametrised by an Algebraic Theory. CoRR abs/2202.06901 (2022) - [i21]Damien Pous, Jurriaan Rot, Jana Wagemaker:
On Tools for Completeness of Kleene Algebra with Hypotheses. CoRR abs/2210.13020 (2022) - 2021
- [j16]Clemens Kupke
Expressive Logics for Coinductive Predicates. Log. Methods Comput. Sci. 17(4) (2021) - [j15]Jurriaan Rot, Bart Jacobs, Paul Blain Levy:
Steps and traces. J. Log. Comput. 31(6): 1482-1525 (2021) - [c40]Damien Pous, Jurriaan Rot, Jana Wagemaker:
On Tools for Completeness of Kleene Algebra with Hypotheses. RAMiCS 2021: 378-395 - [c39]Gerco van Heerdt
Learning Pomset Automata. FoSSaCS 2021: 510-530 - [c38]Yuichi Komorida, Shin-ya Katsumata, Clemens Kupke
Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation. LICS 2021: 1-14 - [c37]Todd Schmid
On Star Expressions and Coalgebraic Completeness Theorems. MFPS 2021: 242-259 - [i20]Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Alexandra Silva:
Learning Pomset Automata. CoRR abs/2102.07504 (2021) - [i19]Yuichi Komorida, Shin-ya Katsumata, Clemens Kupke, Jurriaan Rot, Ichiro Hasuo:
Expressivity of Quantitative Modal Logics: Categorical Foundations via Codensity and Approximation. CoRR abs/2105.10164 (2021) - [i18]Frits W. Vaandrager, Bharat Garhewal, Jurriaan Rot, Thorsten Wißmann:
A New Approach for Active Automata Learning Based on Apartness. CoRR abs/2107.05419 (2021) - 2020
- [j14]Davide Ancona
A big step from finite to infinite computations. Sci. Comput. Program. 197: 102492 (2020) - [c36]Jana Wagemaker
Partially Observable Concurrent Kleene Algebra. CONCUR 2020: 20:1-20:22 - [c35]Clemens Kupke
Expressive Logics for Coinductive Predicates. CSL 2020: 26:1-26:18 - [c34]Joshua Moerman
Separation and Renaming in Nominal Sets. CSL 2020: 31:1-31:17 - [c33]Davide Ancona
A Big Step from Finite to Infinite Computations (SCICO Journal-first). ECOOP 2020: 32:1-32:2 - [c32]Gerco van Heerdt, Clemens Kupke
Learning Weighted Automata over Principal Ideal Domains. FoSSaCS 2020: 602-621 - [c31]Louis Parlant, Jurriaan Rot, Alexandra Silva, Bas Westerbaan
Preservation of Equations by Monoidal Monads. MFCS 2020: 77:1-77:14 - [c30]Rick Erkens, Jurriaan Rot, Bas Luttik:
Up-to Techniques for Branching Bisimilarity. SOFSEM 2020: 285-297 - [e3]Daniela Petrisan, Jurriaan Rot:
Coalgebraic Methods in Computer Science - 15th IFIP WG 1.3 International Workshop, CMCS 2020, Colocated with ETAPS 2020, Dublin, Ireland, April 25-26, 2020, Proceedings. Lecture Notes in Computer Science 12094, Springer 2020, ISBN 978-3-030-57200-6 [contents] - [e2]Ornela Dardha, Jurriaan Rot:
Proceedings Combined 27th International Workshop on Expressiveness in Concurrency and 17th Workshop on Structural Operational Semantics, EXPRESS/SOS 2020, and 17th Workshop on Structural Operational SemanticsOnline, 31 August 2020. EPTCS 322, 2020 [contents] - [i17]Gerco van Heerdt, Tobias Kappé
A Categorical Framework for Learning Generalised Tree Automata. CoRR abs/2001.05786 (2020) - [i16]Louis Parlant, Jurriaan Rot, Alexandra Silva, Bas Westerbaan:
Preservation of Equations by Monoidal Monads. CoRR abs/2001.06348 (2020) - [i15]Rick Erkens, Jurriaan Rot, Bas Luttik:
Up-to Techniques for Branching Bisimilarity. CoRR abs/2001.08944 (2020) - [i14]Jurriaan Rot, Bart Jacobs, Paul Blain Levy:
Steps and Traces. CoRR abs/2004.05400 (2020) - [i13]Clemens Kupke, Jurriaan Rot:
Expressive Logics for Coinductive Predicates. CoRR abs/2006.12465 (2020) - [i12]Jana Wagemaker, Paul Brunet
Partially Observable Concurrent Kleene Algebra. CoRR abs/2007.07593 (2020)
2010 – 2019
- 2019
- [j13]Jurriaan Rot:
Distributive laws for monotone specifications. Acta Informatica 56(7-8): 585-617 (2019) - [j12]Stijn de Gouw
Verifying OpenJDK's Sort Method for Generic Collections. J. Autom. Reason. 62(1): 93-126 (2019) - [j11]Damien Pous, Jurriaan Rot:
Companions, Causality and Codensity. Log. Methods Comput. Sci. 15(3) (2019) - [j10]Filippo Bonchi
Bisimilarity of open terms in stream GSOS. Sci. Comput. Program. 172: 1-26 (2019) - [c29]Gerco van Heerdt
Tree Automata as Algebras: Minimisation and Determinisation. CALCO 2019: 6:1-6:22 - [c28]Tobias Kappé
Kleene Algebra with Observations. CONCUR 2019: 41:1-41:16 - [c27]Simone Barlocco, Clemens Kupke
Coalgebra Learning via Duality. FoSSaCS 2019: 62-79 - [c26]Jana Wagemaker, Marcello M. Bonsangue, Tobias Kappé
Completeness and Incompleteness of Synchronous Kleene Algebra. MPC 2019: 385-413 - [e1]Jorge A. Pérez, Jurriaan Rot:
Proceedings Combined 26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics, EXPRESS/SOS 2019, Amsterdam, The Netherlands, 26th August 2019. EPTCS 300, 2019 [contents] - [i11]Simone Barlocco, Clemens Kupke, Jurriaan Rot:
Coalgebra Learning via Duality. CoRR abs/1902.05762 (2019) - [i10]David Venhoek, Joshua Moerman, Jurriaan Rot:
Fast Computations on Ordered Nominal Sets. CoRR abs/1902.08414 (2019) - [i9]Gerco van Heerdt, Tobias Kappé
Tree Automata as Algebras: Minimisation and Determinisation. CoRR abs/1904.08802 (2019) - [i8]Jana Wagemaker, Marcello M. Bonsangue, Tobias Kappé
Completeness and Incompleteness of Synchronous Kleene Algebra. CoRR abs/1905.08554 (2019) - [i7]Joshua Moerman
Separation and Renaming in Nominal Sets. CoRR abs/1906.00763 (2019) - [i6]Gerco van Heerdt, Clemens Kupke, Jurriaan Rot, Alexandra Silva:
Learning Weighted Automata over Principal Ideal Domains. CoRR abs/1911.04404 (2019) - 2018
- [c25]Alexandre Goy
(In)finite Trace Equivalence of Probabilistic Transition Systems. CMCS 2018: 100-121 - [c24]Bart Jacobs, Paul Blain Levy, Jurriaan Rot:
Steps and Traces. CMCS 2018: 122-143 - [c23]David Venhoek, Joshua Moerman
Fast Computations on Ordered Nominal Sets. ICTAC 2018: 493-512 - [i5]Meven Bertrand, Jurriaan Rot:
Coalgebraic Determinization of Alternating Automata. CoRR abs/1804.02546 (2018) - [i4]Filippo Bonchi, Tom van Bussel, Matias David Lee, Jurriaan Rot:
Bisimilarity of Open Terms in Stream GSOS. CoRR abs/1811.03606 (2018) - [i3]Tobias Kappé
Kleene Algebra with Observations. CoRR abs/1811.10401 (2018) - 2017
- [j9]Filippo Bonchi
A general account of coinduction up-to. Acta Informatica 54(2): 127-190 (2017) - [j8]Jurriaan Rot, Filippo Bonchi
Enhanced coalgebraic bisimulation. Math. Struct. Comput. Sci. 27(7): 1236-1264 (2017) - [c22]Henning Basold, Damien Pous, Jurriaan Rot:
Monoidal Company for Accessible Functors. CALCO 2017: 5:1-5:16 - [c21]Damien Pous, Jurriaan Rot:
Companions, Codensity and Causality. FoSSaCS 2017: 106-123 - [c20]Filippo Bonchi
Bisimilarity of Open Terms in Stream GSOS. FSEN 2017: 35-50 - [c19]Jurriaan Rot:
Distributive Laws for Monotone Specifications. EXPRESS/SOS 2017: 83-97 - [i2]Damien Pous, Jurriaan Rot:
Companions, Causality and Codensity. CoRR abs/1712.08526 (2017) - 2016
- [j7]Bartek Klin
Coalgebraic trace semantics via forgetful logics. Log. Methods Comput. Sci. 12(4) (2016) - [j6]Jurriaan Rot, Marcello M. Bonsangue
Proving language inclusion and equivalence by coinduction. Inf. Comput. 246: 62-76 (2016) - [j5]Jurriaan Rot, Marcello M. Bonsangue
Structural congruence for bialgebraic semantics. J. Log. Algebraic Methods Program. 85(6): 1268-1291 (2016) - [c18]Stijn de Gouw
Effectively Eliminating Auxiliaries. Theory and Practice of Formal Methods 2016: 226-241 - [c17]Julian Salamanca, Marcello M. Bonsangue
Duality of Equations and Coequations via Contravariant Adjunctions. CMCS 2016: 73-93 - [c16]Jurriaan Rot:
Coalgebraic Minimization of Automata by Initiality and Finality. MFPS 2016: 253-276 - [p1]Stijn de Gouw
Verification of Counting Sort and Radix Sort. Deductive Software Verification 2016: 609-618 - 2015
- [j4]Marcello M. Bonsangue
Presenting Distributive Laws. Log. Methods Comput. Sci. 11(3) (2015) - [j3]Irina Mariuca Asavoae, Frank S. de Boer, Marcello M. Bonsangue
Model checking recursive programs interacting via the heap. Sci. Comput. Program. 100: 61-83 (2015) - [j2]Frank S. de Boer, Marcello M. Bonsangue
It is pointless to point in bounded heaps. Sci. Comput. Program. 112: 102-118 (2015) - [c15]Stijn de Gouw
OpenJDK's Java.utils.Collection.sort() Is Broken: The Good, the Bad and the Worst Case. CAV (1) 2015: 273-289 - [c14]Filippo Bonchi
Lax Bialgebras and Up-To Techniques for Weak Bisimulations. CONCUR 2015: 240-253 - [c13]Bartek Klin
Coalgebraic Trace Semantics via Forgetful Logics. FoSSaCS 2015: 151-166 - 2014
- [j1]Stijn de Gouw
Proof Pearl: The KeY to Correct and Stable Sorting. J. Autom. Reason. 53(2): 129-139 (2014) - [c12]Filippo Bonchi
Coinduction up-to in a fibrational setting. CSL-LICS 2014: 20:1-20:9 - [c11]Jurriaan Rot, Marcello M. Bonsangue
Combining Bialgebraic Semantics and Equations. FoSSaCS 2014: 381-395 - [c10]Marcello M. Bonsangue
A Coalgebraic Foundation for Coinductive Union Types. ICALP (2) 2014: 62-73 - [i1]Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot:
Coinduction up to in a fibrational setting. CoRR abs/1401.6675 (2014) - 2013
- [c9]Marcello M. Bonsangue, Helle Hvid Hansen
Presenting Distributive Laws. CALCO 2013: 95-109 - [c8]Jurriaan Rot, Frank S. de Boer, Marcello M. Bonsangue
Unbounded Allocation in Bounded Heaps. FSEN 2013: 1-16 - [c7]Jurriaan Rot, Marcello M. Bonsangue
Coinductive Proof Techniques for Language Equivalence. LATA 2013: 480-492 - [c6]Jurriaan Rot, Marcello M. Bonsangue
Coalgebraic Bisimulation-Up-To. SOFSEM 2013: 369-381 - [c5]Stefan Milius, Marcello M. Bonsangue
Rational Operational Models. MFPS 2013: 257-282 - 2012
- [c4]Frank S. de Boer, Marcello M. Bonsangue
Automated Verification of Recursive Programs with Pointers. IJCAR 2012: 149-163 - [c3]Irina Mariuca Asavoae, Frank S. de Boer, Marcello M. Bonsangue
Bounded Model Checking of Recursive Programs with Pointers in K. WADT 2012: 59-76 - [c2]Marcello M. Bonsangue
On the specification of operations on the rational behaviour of systems. EXPRESS/SOS 2012: 3-18 - [c1]Jurriaan Rot, Irina Mariuca Asavoae, Frank S. de Boer, Marcello M. Bonsangue
Interacting via the Heap in the Presence of Recursion. ICE 2012: 99-113
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: