Publications

Publications for Federico Olmedo

2018
DOI
[bibtex]
Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo. Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms. Journal of the ACM 65(5), pages 30:1-30:68, 2018.
DOI
[bibtex]
Federico Olmedo, Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Annabelle McIver. Conditioning in Probabilistic Programming. ACM Transactions on Programming Languages and Systems (TOPLAS) 40(1), pages 4:1-4:50, 2018.
2016
Download
[bibtex]
Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. Reasoning about Recursive Probabilistic Programs. Proc. of the 31st Annual Symposium on Logic in Computer Science (LICS 2016), pages 672-681, ACM, 2016.
DOI
[bibtex]
Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo. Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs (EATCS Best Paper Award). Proc. of the 25th European Symposium on Programming (ESOP 2016), Volume 9632 of LNCS, pages 364 - 389, Springer, 2016.

[bibtex]
Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Federico Olmedo. On the Semantic Intricacies of Conditioning. Collected Abstracts of the 1st Workshop on Probabilistic Programming Semantics (PPS 2016), 2016.
2015
Download
[bibtex]
Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo. Probabilistic Programs - A Natural Model for Approximate Computations. Workshop on Approximate Computing (AC15), 2015.
DOI
[bibtex]
Joost-Pieter Katoen, Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Federico Olmedo. Understanding Probabilistic Programs. Correct System Design - Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, Volume 9360 of LNCS, pages 15-32, Springer, 2015.
Download
[bibtex]
Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Federico Olmedo, Friedrich Gretz, Annabelle McIver. Conditioning in Probabilistic Programming. Proc. of the 31st Conference on the Mathematical Foundations of Programming Semantics (MFPS 2015), ENTCS 319, pages 199-216, 2015.
2014
Download
[bibtex]
Federico Olmedo. Approximate Relational Reasoning for Probabilistic Programs. Phd Thesis at Technical University of Madrid, 2014.
2013
Download
[bibtex]
Gilles Barthe, Boris Köpf, Federico Olmedo, Santiago Zanella Béguelin. Probabilistic Relational Reasoning for Differential Privacy. ACM Transactions on Programming Languages and Systems 35(3), 2013.
Download
[bibtex]
Gilles Barthe, Federico Olmedo. Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs. In , Automata, Languages, and Programming, pages 49–60, Volume 7966 of Lecture Notes in Computer Science, 2013.
Download
[bibtex]
Gilles Barthe, Benjamin Grégoire, Sylvain Heraud, Federico Olmedo, Santiago Zanella Béguelin. Verified Indifferentiable Hashing into Elliptic Curves. Journal of Computer Security 21(6), pages 881–917, 2013.
2012
Download
[bibtex]
Gilles Barthe, Benjamin Grégoire, Sylvain Heraud, Federico Olmedo, Santiago Zanella Béguelin. Verified Indifferentiable Hashing into Elliptic Curves. 1st Conference on Principles of Security and Trust – POST 2012, Volume of Lecture Notes in Computer Science, Springer, 2012.
Download
[bibtex]
Gilles Barthe, Boris Köpf, Federico Olmedo, Santiago Zanella Béguelin. Probabilistic Relational Reasoning for Differential Privacy. 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 97–110, ACM, 2012.
2011
Download
[bibtex]
Gilles Barthe, Federico Olmedo, Santiago Zanella Béguelin. Verifiable Security of Boneh-Franklin Identity-Based Encryption. 5th International Conference on Provable Security, Volume 6980 of Lecture Notes in Computer Science, pages 68–83, Springer, 2011.
2009
Download
[bibtex]
Santiago Zanella Béguelin, Benjamin Grégoire, Gilles Barthe, Federico Olmedo. Formally Certifying the Security of Digital Signature Schemes. 30th IEEE Symposium on Security and Privacy, pages 237–250, IEEE Computer Society, 2009.