| Probabilistic relational reasoning for differential privacy G Barthe, B Köpf, F Olmedo, S Zanella Beguelin Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2012 | 200 | 2012 |
| Weakest precondition reasoning for expected run–times of probabilistic programs BL Kaminski, JP Katoen, C Matheja, F Olmedo Programming Languages and Systems: 25th European Symposium on Programming …, 2016 | 168 | 2016 |
| Reasoning about recursive probabilistic programs F Olmedo, BL Kaminski, JP Katoen, C Matheja Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 111 | 2016 |
| Probabilistic relational reasoning for differential privacy G Barthe, B Köpf, F Olmedo, S Zanella-Béguelin ACM Transactions on Programming Languages and Systems (TOPLAS) 35 (3), 1-49, 2013 | 110 | 2013 |
| Weakest precondition reasoning for expected runtimes of randomized algorithms BL Kaminski, JP Katoen, C Matheja, F Olmedo Journal of the ACM (JACM) 65 (5), 1-68, 2018 | 104 | 2018 |
| Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs G Barthe, F Olmedo International Colloquium on Automata, Languages, and Programming, 49-60, 2013 | 89 | 2013 |
| Conditioning in probabilistic programming F Olmedo, F Gretz, N Jansen, BL Kaminski, JP Katoen, A McIver ACM Transactions on Programming Languages and Systems (TOPLAS) 40 (1), 1-50, 2018 | 61 | 2018 |
| Conditioning in probabilistic programming N Jansen, BL Kaminski, JP Katoen, F Olmedo, F Gretz, A McIver Electronic Notes in Theoretical Computer Science 319, 199-216, 2015 | 48* | 2015 |
| Formally certifying the security of digital signature schemes S Zanella-Béguelin, G Barthe, B Grégoire, F Olmedo 2009 30th IEEE Symposium on Security and Privacy, 237-250, 2009 | 39 | 2009 |
| Understanding probabilistic programs JP Katoen, F Gretz, N Jansen, BL Kaminski, F Olmedo Correct System Design: Symposium in Honor of Ernst-Rüdiger Olderog on the …, 2015 | 28 | 2015 |
| Verified indifferentiable hashing into elliptic curves G Barthe, B Grégoire, S Heraud, F Olmedo, S Zanella Béguelin International Conference on Principles of Security and Trust, 209-228, 2012 | 21 | 2012 |
| Approximate relational reasoning for probabilistic programs F Olmedo Informatica, 2014 | 15 | 2014 |
| A mechanized formalization of GraphQL T Díaz, F Olmedo, É Tanter Proceedings of the 9th ACM SIGPLAN International Conference on Certified …, 2020 | 14 | 2020 |
| Contextual linear types for differential privacy M Toro, D Darais, C Abuah, JP Near, D Árquez, F Olmedo, É Tanter ACM Transactions on Programming Languages and Systems 45 (2), 1-69, 2023 | 12 | 2023 |
| Verifiable security of boneh-franklin identity-based encryption G Barthe, F Olmedo, SZ Béguelin International Conference on Provable Security, 68-83, 2011 | 12 | 2011 |
| Runtime analysis of quantum programs: A formal approach F Olmedo, A Díaz-Caro arXiv preprint arXiv:1911.11247, 2019 | 6 | 2019 |
| Verified indifferentiable hashing into elliptic curves G Barthe, B Grégoire, S Heraud, F Olmedo, S Zanella-Béguelin Journal of computer security 21 (6), 881-917, 2013 | 5 | 2013 |
| Differential privacy and SPARQL C Buil-Aranda, J Lobo, F Olmedo Semantic Web 15 (3), 745-773, 2024 | 3 | 2024 |
| A Gradual Probabilistic Lambda Calculus W Ye, M Toro, F Olmedo Proceedings of the ACM on Programming Languages 7 (OOPSLA1), 256-285, 2023 | 2 | 2023 |
| Slicing of probabilistic programs based on specifications M Navarro, F Olmedo Science of Computer Programming 220, 102822, 2022 | 2 | 2022 |
Benjamin Lucien KaminskiProfessor of Computer Science at Saarland University and Lecturer at University College LondonVerified email at cs.uni-saarland.de