Federico Olmedo

Orcid: 0000-0003-0217-6483

Affiliations:
  • University of Chile, Chile
  • RWTH Aachen University, Germany (former)
  • IMDEA Software Institute, Madrid, Spain (former)


According to our database1, Federico Olmedo authored at least 20 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Gradual Differentially Private Programming.
Commun. ACM, August, 2024

Differential privacy and SPARQL.
Semantic Web, 2024

2023
Contextual Linear Types for Differential Privacy.
ACM Trans. Program. Lang. Syst., June, 2023

A Gradual Probabilistic Lambda Calculus.
Proc. ACM Program. Lang., April, 2023

2022
Slicing of probabilistic programs based on specifications.
Sci. Comput. Program., 2022

Slicing of Probabilistic Programs Based on Specifications (Extended Abstract).
Proceedings of the 36th European Conference on Object-Oriented Programming, 2022

2020
Contextual Linear Types for Differential Privacy.
CoRR, 2020

A mechanized formalization of GraphQL.
Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020

2019
Runtime Analysis of Quantum Programs: A Formal Approach.
CoRR, 2019

2018
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms.
J. ACM, 2018

2016
Reasoning about Recursive Probabilistic Programs.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs.
Proceedings of the Programming Languages and Systems, 2016

2015
Conditioning in Probabilistic Programming.
Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics, 2015

Understanding Probabilistic Programs.
Proceedings of the Correct System Design, 2015

2014
Approximate Relational Reasoning for Probabilistic Programs.
PhD thesis, 2014

2013
Probabilistic Relational Reasoning for Differential Privacy.
ACM Trans. Program. Lang. Syst., 2013

Verified indifferentiable hashing into elliptic curves.
J. Comput. Secur., 2013

Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2011
Verifiable Security of Boneh-Franklin Identity-Based Encryption.
Proceedings of the Provable Security - 5th International Conference, 2011

2009
Formally Certifying the Security of Digital Signature Schemes.
Proceedings of the 30th IEEE Symposium on Security and Privacy (SP 2009), 2009


  Loading...