| Diaframe: automated verification of fine-grained concurrent programs in Iris I Mulder, R Krebbers, H Geuvers Proceedings of the 43rd ACM SIGPLAN International Conference on Programming …, 2022 | 42 | 2022 |
| Proof automation for linearizability in separation logic I Mulder, R Krebbers Proceedings of the ACM on Programming Languages 7 (OOPSLA1), 462-491, 2023 | 9 | 2023 |
| Beyond Backtracking: Connections in Fine-Grained Concurrent Separation Logic I Mulder, Ł Czajka, R Krebbers Proceedings of the ACM on Programming Languages 7 (PLDI), 1340-1364, 2023 | 4 | 2023 |
| Unification for Subformula Linking under Quantifiers I Mulder, R Krebbers Proceedings of the 13th ACM SIGPLAN International Conference on Certified …, 2024 | 2 | 2024 |
| Artifact of'Proof Automation for Linearizability in Separation Logic' IN Mulder, RJ Krebbers Zenodo, 2023 | 1 | 2023 |
| A Proof Recipe for Linearizability in Relaxed Memory Separation Logic S Park, J Kim, I Mulder, J Jung, J Lee, R Krebbers, J Kang Proceedings of the ACM on Programming Languages 8 (PLDI), 175-198, 2024 | | 2024 |
| Prusti in Practice S Gijsberts | | 2023 |
| Artifact and Appendix of'Diaframe: Automated Verification of Fine-Grained Concurrent Programs in Iris' IN Mulder, H Geuvers, RJ Krebbers Zenodo, 2022 | | 2022 |
| Formal verification of upper bounds on translative packing densities IN Mulder | | 2019 |
| De Banach-Tarski paradox en het keuzeaxioma I Mulder | | 2017 |
