Federico Olmedo

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Weakest precondition reasoning for expected runtimes of randomized algorithms Journal of the ACM	2019-02-25	Paper
Reasoning about Recursive Probabilistic Programs Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science	2018-04-23	Paper
Conditioning in probabilistic programming Electronic Notes in Theoretical Computer Science	2016-12-16	Paper
Weakest precondition reasoning for expected run-times of probabilistic programs Programming Languages and Systems	2016-04-26	Paper
Understanding probabilistic programs Lecture Notes in Computer Science	2015-11-04	Paper
Probabilistic relational reasoning for differential privacy Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages	2015-09-11	Paper
Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs Automata, Languages, and Programming	2013-08-07	Paper
Verified indifferentiable hashing into elliptic curves Lecture Notes in Computer Science	2012-06-29	Paper
Verifiable security of Boneh-Franklin identity-based encryption Provable Security	2011-09-16	Paper

Research outcomes over time

This page was built for person: Federico Olmedo