Ranking and Repulsing Supermartingales for Reachability in Probabilistic Programs

05/28/2018
by   Toru Takisaka, et al.
0

Computing reachability probabilities is a fundamental problem in the analysis of probabilistic programs. This paper aims at a comprehensive and comparative account on various martingale-based methods for over- and under-approximating reachability probabilities. Based on the existing works that stretch across different communities (formal verification, control theory, etc.), we offer a unifying account. In particular, we emphasize the role of order-theoretic fixed points---a classic topic in computer science---in the analysis of probabilistic programs. This leads us to two new martingale-based techniques, too. We give rigorous proofs for their soundness and completeness. We also make an experimental comparison using our implementation of template-based synthesis algorithms for those martingales.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

05/28/2018

Ranking and Repulsing Supermartingales for Approximating Reachability

Computing reachability probabilities is a fundamental problem in the ana...
07/28/2020

Inductive Reachability Witnesses

In this work, we consider the fundamental problem of reachability analys...
11/17/2017

A Supervisory Control Algorithm Based on Property-Directed Reachability

We present an algorithm for synthesising a controller (supervisor) for a...
05/13/2020

FlowCFL: A Framework for Type-based Reachability Analysis in the Presence of Mutable Data

Reachability analysis is a fundamental program analysis with a wide vari...
06/24/2021

Comparison between safety methods control barrier function vs. reachability analysis

This report aims to compare two safety methods: control barrier function...
04/13/2018

Sound Value Iteration

Computing reachability probabilities is at the heart of probabilistic mo...
11/16/2018

Tail Probabilities for Randomized Program Runtimes via Martingales for Higher Moments

Programs with randomization constructs is an active research topic, espe...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.