Synthesizing Probabilistic Invariants via Doob's Decomposition

05/09/2016
by   Gilles Barthe, et al.
0

When analyzing probabilistic computations, a powerful approach is to first find a martingale---an expression on the program variables whose expectation remains invariant---and then apply the optional stopping theorem in order to infer properties at termination time. One of the main challenges, then, is to systematically find martingales. We propose a novel procedure to synthesize martingale expressions from an arbitrary initial expression. Contrary to state-of-the-art approaches, we do not rely on constraint solving. Instead, we use a symbolic construction based on Doob's decomposition. This procedure can produce very complex martingales, expressed in terms of conditional expectations. We show how to automatically generate and simplify these martingales, as well as how to apply the optional stopping theorem to infer properties at termination time. This last step typically involves some simplification steps, and is usually done manually in current approaches. We implement our techniques in a prototype tool and demonstrate our process on several classical examples. Some of them go beyond the capability of current semi-automatic approaches.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2019

Polynomial Probabilistic Invariants and the Optional Stopping Theorem

In this paper we present methods for the synthesis of polynomial invaria...
research
06/14/2018

New Approaches for Almost-Sure Termination of Probabilistic Programs

We study the almost-sure termination problem for probabilistic programs....
research
08/14/2020

Proving Almost-Sure Termination of Probabilistic Programs via Incremental Pruning

The extension of classical imperative programs with real-valued random v...
research
07/27/2021

The Probabilistic Termination Tool Amber

We describe the Amber tool for proving and refuting the termination of a...
research
03/30/2021

Expected-Cost Analysis for Probabilistic Programs and Semantics-Level Adaption of Optional Stopping Theorems

In this article, we present a semantics-level adaption of the Optional S...
research
12/11/2020

Probabilistic Conditional System Invariant Generation with Bayesian Inference

Invariants are a set of properties over program attributes that are expe...
research
07/22/2021

Kernel-Matrix Determinant Estimates from stopped Cholesky Decomposition

Algorithms involving Gaussian processes or determinantal point processes...

Please sign up or login with your details

Forgot password? Click here to reset