| OpenJDK’s Java. utils. Collection. sort () is broken: The good, the bad and the worst case S De Gouw, J Rot, FS de Boer, R Bubel, R Hähnle International Conference on Computer Aided Verification, 273-289, 2015 | 55 | 2015 |
| Coinduction up-to in a fibrational setting F Bonchi, D Petrişan, D Pous, J Rot Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 47 | 2014 |
| Coalgebraic bisimulation-up-to J Rot, M Bonsangue, J Rutten International Conference on Current Trends in Theory and Practice of …, 2013 | 46 | 2013 |
| Presenting distributive laws MM Bonsangue, HH Hansen, A Kurz, J Rot International Conference on Algebra and Coalgebra in Computer Science, 95-109, 2013 | 36 | 2013 |
| Enhanced coalgebraic bisimulation J Rot, F Bonchi, M Bonsangue, D Pous, J Rutten, A Silva Mathematical Structures in Computer Science 27 (7), 1236-1264, 2017 | 27 | 2017 |
| A general account of coinduction up-to F Bonchi, D Petrişan, D Pous, J Rot Acta Informatica 54 (2), 127-190, 2017 | 24 | 2017 |
| Coalgebraic trace semantics via forgetful logics B Klin, J Rot International Conference on Foundations of Software Science and Computation …, 2015 | 23 | 2015 |
| Enhanced coinduction J Rot Phd, University Leiden, Leiden, 2015 | 19 | 2015 |
| Verifying openjdk’s sort method for generic collections S de Gouw, FS de Boer, R Bubel, R Hähnle, J Rot, D Steinhöfel Journal of automated reasoning 62 (1), 93-126, 2019 | 14 | 2019 |
| Proof pearl: the KeY to correct and stable sorting S de Gouw, F de Boer, J Rot Journal of automated reasoning 53 (2), 129-139, 2014 | 14 | 2014 |
| Coinductive proof techniques for language equivalence J Rot, M Bonsangue, J Rutten International Conference on Language and Automata Theory and Applications …, 2013 | 14 | 2013 |
| Companions, codensity and causality D Pous, J Rot International Conference on Foundations of Software Science and Computation …, 2017 | 13 | 2017 |
| Proving language inclusion and equivalence by coinduction J Rot, M Bonsangue, J Rutten Information and Computation 246, 62-76, 2016 | 12 | 2016 |
| A coalgebraic foundation for coinductive union types M Bonsangue, J Rot, D Ancona, F de Boer, J Rutten International Colloquium on Automata, Languages, and Programming, 62-73, 2014 | 12 | 2014 |
| Monoidal company for accessible functors H Basold, D Pous, J Rot | 9 | 2017 |
| Combining bialgebraic semantics and equations J Rot, M Bonsangue International Conference on Foundations of Software Science and Computation …, 2014 | 9 | 2014 |
| Interacting via the Heap in the Presence of Recursion J Rot, IM Asăvoae, F de Boer, MM Bonsangue, D Lucanu arXiv preprint arXiv:1212.3879, 2012 | 9 | 2012 |
| Lax bialgebras and up-to techniques for weak bisimulations F Bonchi, DL Petrisan, D Pous, J Rot Dagstuhl: Schloss Dagstuhl, 2015 | 8 | 2015 |
| Coalgebra learning via duality S Barlocco, C Kupke, J Rot International Conference on Foundations of Software Science and Computation …, 2019 | 7 | 2019 |
| Coalgebraic Minimization of Automata by Initiality and Finality. J Rot MFPS, 253-276, 2016 | 7 | 2016 |
