Jurriaan Rot

According to our database1, Jurriaan Rot
  • authored at least 29 papers between 2012 and 2017.
  • has a "Dijkstra number"2 of four.



In proceedings 
PhD thesis 


On csauthors.net:


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

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

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

Structural congruence for bialgebraic semantics.
J. Log. Algebr. Meth. Program., 2016

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

Coalgebraic Minimization of Automata by Initiality and Finality.
Electr. Notes Theor. Comput. Sci., 2016

Coalgebraic trace semantics via forgetful logics.
Logical Methods in Computer Science, 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

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.
Logical Methods in Computer Science, 2015

Coalgebraic Trace Semantics via Forgetful Logics.
Proceedings of the Foundations of Software Science and Computation Structures, 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

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

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

Rational Operational Models.
Electr. Notes Theor. Comput. Sci., 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

Presenting Distributive Laws.
Proceedings of the Algebra and Coalgebra in Computer Science, 2013

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