default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFederico Olmedo
Person information
- affiliation: University of Chile, Chile
- affiliation (former): RWTH Aachen University, Germany
- affiliation (former): IMDEA Software Institute, Madrid, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Matías Toro
, Federico Olmedo, Éric Tanter:
Gradual Differentially Private Programming. Commun. ACM 67(8): 49-53 (2024)- [j8]Carlos Buil-Aranda, Jorge Lobo, Federico Olmedo:
Differential privacy and SPARQL. Semantic Web 15(3): 745-773 (2024) - 2023
- [j7]Wenjia Ye, Matías Toro, Federico Olmedo:
A Gradual Probabilistic Lambda Calculus. Proc. ACM Program. Lang. 7(OOPSLA1): 256-285 (2023) - [j6]Matías Toro, David Darais, Chike Abuah, Joseph P. Near, Damián Árquez, Federico Olmedo, Éric Tanter:
Contextual Linear Types for Differential Privacy. ACM Trans. Program. Lang. Syst. 45(2): 8:1-8:69 (2023) - 2022
- [j5]Marcelo Navarro, Federico Olmedo:
Slicing of probabilistic programs based on specifications. Sci. Comput. Program. 220: 102822 (2022) - [c11]Marcelo Navarro, Federico Olmedo:
Slicing of Probabilistic Programs Based on Specifications (Extended Abstract). ECOOP 2022: 34:1-34:2 - [i6]Marcelo Navarro, Federico Olmedo:
Slicing of Probabilistic Programs based on Specifications. CoRR abs/2205.03707 (2022) - 2020
- [c10]Tomás Díaz, Federico Olmedo, Éric Tanter:
A mechanized formalization of GraphQL. CPP 2020: 201-214 - [i5]Matías Toro, David Darais, Chike Abuah, Joe Near, Federico Olmedo, Éric Tanter:
Contextual Linear Types for Differential Privacy. CoRR abs/2010.11342 (2020)
2010 – 2019
- 2019
- [i4]Federico Olmedo, Alejandro Díaz-Caro:
Runtime Analysis of Quantum Programs: A Formal Approach. CoRR abs/1911.11247 (2019) - 2018
- [j4]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo:
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms. J. ACM 65(5): 30:1-30:68 (2018) - [j3]Federico Olmedo, Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Annabelle McIver:
Conditioning in Probabilistic Programming. ACM Trans. Program. Lang. Syst. 40(1): 4:1-4:50 (2018) - 2016
- [c9]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo:
Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. ESOP 2016: 364-389 - [c8]Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Reasoning about Recursive Probabilistic Programs. LICS 2016: 672-681 - [i3]Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo:
Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. CoRR abs/1601.01001 (2016) - [i2]Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Reasoning about Recursive Probabilistic Programs. CoRR abs/1603.02922 (2016) - 2015
- [c7]Joost-Pieter Katoen, Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Federico Olmedo:
Understanding Probabilistic Programs. Correct System Design 2015: 15-32 - [c6]Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Federico Olmedo, Friedrich Gretz, Annabelle McIver:
Conditioning in Probabilistic Programming. MFPS 2015: 199-216 - [i1]Friedrich Gretz, Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Annabelle McIver, Federico Olmedo:
Conditioning in Probabilistic Programming. CoRR abs/1504.00198 (2015) - 2014
- [b1]Federico Olmedo:
Approximate Relational Reasoning for Probabilistic Programs. Technical University of Madrid, Spain, 2014 - 2013
- [j2]Gilles Barthe, Benjamin Grégoire, Sylvain Heraud, Federico Olmedo, Santiago Zanella Béguelin:
Verified indifferentiable hashing into elliptic curves. J. Comput. Secur. 21(6): 881-917 (2013) - [j1]Gilles Barthe, Boris Köpf, Federico Olmedo, Santiago Zanella Béguelin:
Probabilistic Relational Reasoning for Differential Privacy. ACM Trans. Program. Lang. Syst. 35(3): 9:1-9:49 (2013) - [c5]Gilles Barthe, Federico Olmedo:
Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs. ICALP (2) 2013: 49-60 - 2012
- [c4]Gilles Barthe, Boris Köpf, Federico Olmedo, Santiago Zanella Béguelin:
Probabilistic relational reasoning for differential privacy. POPL 2012: 97-110 - [c3]Gilles Barthe, Benjamin Grégoire, Sylvain Heraud, Federico Olmedo, Santiago Zanella Béguelin:
Verified Indifferentiable Hashing into Elliptic Curves. POST 2012: 209-228 - 2011
- [c2]Gilles Barthe, Federico Olmedo, Santiago Zanella Béguelin:
Verifiable Security of Boneh-Franklin Identity-Based Encryption. ProvSec 2011: 68-83
2000 – 2009
- 2009
- [c1]Santiago Zanella Béguelin, Gilles Barthe, Benjamin Grégoire, Federico Olmedo:
Formally Certifying the Security of Digital Signature Schemes. SP 2009: 237-250
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
