Author image not provided
 Federico Olmedo

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article6.27
Citation Count69
Publication count11
Publication years2009-2016
Available for download3
Average downloads per article370.00
Downloads (cumulative)1,110
Downloads (12 Months)212
Downloads (6 Weeks)38
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


12 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 12 of 12
Sort by:

1 published by ACM
January 2018 ACM Transactions on Programming Languages and Systems (TOPLAS): Volume 40 Issue 1, January 2018
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 31,   Downloads (12 Months): 31,   Downloads (Overall): 31

Full text available: PDFPDF
This article investigates the semantic intricacies of conditioning, a main feature in probabilistic programming. Our study is based on an extension of the imperative probabilistic guarded command language pGCL with conditioning. We provide a weakest precondition (wp) semantics and an operational semantics. To deal with possibly diverging program behavior, we ...
Keywords: operational semantics, conditioning, weakest pre–condition semantics, Probabilistic programming

2 published by ACM
July 2016 LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,   Downloads (12 Months): 63,   Downloads (Overall): 63

Full text available: PDFPDF
This paper presents a wp--style calculus for obtaining expectations on the outcomes of (mutually) recursive probabilistic programs. We provide several proof rules to derive one-- and two--sided bounds for such expectations, and show the soundness of our wp--calculus with respect to a probabilistic pushdown automaton semantics. We also give a ...
Keywords: expected runtime, recursion, probabilisitic programming, program verification, weakest pre--condition calculus

3
April 2016 Proceedings of the 25th European Symposium on Programming Languages and Systems - Volume 9632
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 2

This paper presents a wp---style calculus for obtaining bounds on the expected run---time of probabilistic programs. Its application includes determining the possibly infinite expected termination time of a probabilistic program and proving positive almost---sure termination--does a program terminate with probability one in finite expected time? We provide several proof rules ...
Keywords: Weakest precondition, Expected run---time, Positive almost---sure termination, Probabilistic programs, Program verification

4
April 2016 Proceedings of the 25th European Symposium on Programming Languages and Systems - Volume 9632
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

This paper presents a wp---style calculus for obtaining bounds on the expected run---time of probabilistic programs. Its application includes determining the possibly infinite expected termination time of a probabilistic program and proving positive almost---sure termination--does a program terminate with probability one in finite expected time? We provide several proof rules ...
Keywords: Weakest precondition, Expected run---time, Positive almost---sure termination, Probabilistic programs, Program verification

5
December 2015 Electronic Notes in Theoretical Computer Science (ENTCS): Volume 319 Issue C, December 2015
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

In this paper, we investigate the semantic intricacies of conditioning in probabilistic programming, a major feature, e.g., in machine learning. We provide a quantitative weakest pre-condition semantics. In contrast to all other approaches, non-termination is taken into account by our semantics. We also present an operational semantics in terms of ...
Keywords: Probabilistic Programming, Conditional Probabilities, Program Transformation, Semantics

6
November 2013 Journal of Computer Security - Security and Trust Principles: Volume 21 Issue 6, November 2013
Publisher: IOS Press
Bibliometrics:
Citation Count: 0

Many cryptographic systems based on elliptic curves are proven secure in the Random Oracle Model, assuming there exist probabilistic functions that map elements in some domain e.g. bitstrings onto uniformly and independently distributed points in a curve. When implementing such systems, and in order for the proof to carry over ...
Keywords: Elliptic Curve Cryptography, Random Oracle Model, Indifferentiability, Provable Security

7 published by ACM
November 2013 ACM Transactions on Programming Languages and Systems (TOPLAS): Volume 35 Issue 3, November 2013
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 3,   Downloads (12 Months): 53,   Downloads (Overall): 332

Full text available: PDFPDF
Differential privacy is a notion of confidentiality that allows useful computations on sensible data while protecting the privacy of individuals. Proving differential privacy is a difficult and error-prone task that calls for principled approaches and tool support. Approaches based on linear types and static analysis have recently emerged; however, an ...
Keywords: differential privacy, relational Hoare logic, Coq proof assistant

8
July 2013 ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

f -divergences form a class of measures of distance between probability distributions; they are widely used in areas such as information theory and signal processing. In this paper, we unveil a new connection between f -divergences and differential privacy, a confidentiality policy that provides strong privacy guarantees for private data-mining; ...

9
March 2012 POST'12: Proceedings of the First international conference on Principles of Security and Trust
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

Many cryptographic systems based on elliptic curves are proven secure in the Random Oracle Model, assuming there exist probabilistic functions that map elements in some domain (e.g. bitstrings) onto uniformly and independently distributed points in a curve. When implementing such systems, and in order for the proof to carry over ...

10 published by ACM
January 2012 ACM SIGPLAN Notices - POPL '12: Volume 47 Issue 1, January 2012
Publisher: ACM
Bibliometrics:
Citation Count: 33
Downloads (6 Weeks): 4,   Downloads (12 Months): 93,   Downloads (Overall): 674

Full text available: PDFPDF
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential privacy guarantees for real programs is a difficult and error-prone task that calls for principled approaches and tool support. Approaches based on linear types and static analysis ...
Keywords: coq proof assistant, differential privacy, relational hoare logic
Also published in:
January 2012  POPL '12: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

11
October 2011 ProvSec'11: Proceedings of the 5th international conference on Provable security
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

Identity-based encryption (IBE) allows one party to send ciphered messages to another using an arbitrary identity string as an encryption key. Since IBE does not require prior generation and distribution of keys, it greatly simplifies key management in public-key cryptography. Although the concept of IBE was introduced by Shamir in ...
Keywords: bilinear diffie-hellman problem, iddentity-based encryption, Boneh-Franklin scheme, certicrypt, pairing-based cryptography, verifiable security

12
May 2009 SP '09: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4

We present two machine-checked proofs of the existentialunforgeability under adaptive chosen-message attacks of the FullDomain Hash signature scheme. These proofs formalize the originalargument of Bellare and Rogaway, and an optimal reduction by Coronthat provides a tighter bound on the probability of a forgery. Bothproofs are developed using CertiCrypt, a general ...
Keywords: cryptography, cryptographic proofs, signature schemes, Full Domain Hash, Coq proof assistant, probabilistic progams, programming language, semantics, exact security, provable security, game-based proofs



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us