Towards Automated Proving of Relational Properties of Probabilistic Programs (Invited Talk)

1 pages•Published: July 28, 2014

Klaus von Gleissenthall, Andrey Rybalchenko and Santiago Zanella-Béguelin

Abstract

Some security properties go beyond what is expressible in terms of an
individual execution of a single program. In particular, many security
policies in cryptography can be naturally phrased as relational
properties of two open probabilistic programs. Writing and verifying
proofs of such properties is an error-prone task that calls for
automation and tool support. One of the main difficulties in
automating these proofs lies in finding adequate relational invariants
for loops and specifications for program holes.
In this talk we show
how to automate proofs of relational properties of open probabilistic
programs by adapting techniques for the automatic generation of
universally quantified invariants in a non-relational setting.

In: Alexei Lisitsa and Andrei Nemytykh (editors). VPT 2014. Second International Workshop on Verification and Program Transformation, vol 28, pages 2.

Links:	https://easychair.org/publications/paper/JvN1
	https://doi.org/10.29007/t2h1

BibTeX entry

@inproceedings{VPT2014:Towards_Automated_Proving_Relational,
  author    = {Klaus von Gleissenthall and Andrey Rybalchenko and Santiago Zanella-Béguelin},
  title     = {Towards Automated Proving of Relational Properties of Probabilistic Programs (Invited Talk)},
  booktitle = {VPT 2014. Second International Workshop on Verification and Program Transformation},
  editor    = {Alexei Lisitsa and Andrei Nemytykh},
  series    = {EPiC Series in Computing},
  volume    = {28},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/JvN1},
  doi       = {10.29007/t2h1},
  pages     = {2},
  year      = {2014}}

Download PDF Open PDF in browser