Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued
in favor of developing techniques that help tame the complexity of their proofs. Game-based …
in favor of developing techniques that help tame the complexity of their proofs. Game-based …
Episimdemics: an efficient algorithm for simulating the spread of infectious disease over large realistic social networks
Preventing and controlling outbreaks of infectious diseases such as pandemic influenza is a
top public health priority. We describe EpiSimdemics-a scalable parallel algorithm to …
top public health priority. We describe EpiSimdemics-a scalable parallel algorithm to …
Probabilistic relational reasoning for differential privacy
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 …
allowing useful computations on their private data. Deriving differential privacy guarantees …
Model checking probabilistic systems
The model-checking approach was originally formulated for verifying qualitative properties
of systems, for example safety and liveness (see Chap. 2), and subsequently extended to …
of systems, for example safety and liveness (see Chap. 2), and subsequently extended to …
Probabilistic relational verification for cryptographic implementations
Relational program logics have been used for mechanizing formal proofs of various
cryptographic constructions. With an eye towards scaling these successes towards end-to …
cryptographic constructions. With an eye towards scaling these successes towards end-to …
A game-based abstraction-refinement framework for Markov decision processes
M Kattenbelt, M Kwiatkowska, G Norman… - Formal Methods in …, 2010 - Springer
In the field of model checking, abstraction refinement has proved to be an extremely
successful methodology for combating the state-space explosion problem. However, little …
successful methodology for combating the state-space explosion problem. However, little …
Proofs of randomized algorithms in Coq
P Audebaud, C Paulin-Mohring - Science of Computer Programming, 2009 - Elsevier
Randomized algorithms are widely used for finding efficiently approximated solutions to
complex problems, for instance primality testing and for obtaining good average behavior …
complex problems, for instance primality testing and for obtaining good average behavior …
Probabilistic relational reasoning for differential privacy
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 …
data while protecting the privacy of individuals. Proving differential privacy is a difficult and …
Linear-invariant generation for probabilistic programs: Automated support for proof-based methods
We present a constraint-based method for automatically generating quantitative invariants
for linear probabilistic programs, and we show how it can be used, in combination with proof …
for linear probabilistic programs, and we show how it can be used, in combination with proof …
Three chapters of measure theory in Isabelle/HOL
J Hölzl, A Heller - International Conference on Interactive Theorem …, 2011 - Springer
Currently published HOL formalizations of measure theory concentrate on the Lebesgue
integral and they are restricted to real-valued measures. We lift this restriction by introducing …
integral and they are restricted to real-valued measures. We lift this restriction by introducing …