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

03/30/2021
by   Di Wang, et al.
0

In this article, we present a semantics-level adaption of the Optional Stopping Theorem, sketch an expected-cost analysis as its application, and survey different variants of the Optional Stopping Theorem that have been used in static analysis of probabilistic programs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/12/2021

On Signings and the Well-Founded Semantics

In this note, we use Kunen's notion of a signing to establish two theore...
research
06/20/2018

An Application of Computable Distributions to the Semantics of Probabilistic Programs

In this chapter, we explore how (Type-2) computable distributions can be...
research
11/07/2017

A Semantics for Probabilistic Control-Flow Graphs

This article develops a novel operational semantics for probabilistic co...
research
12/11/2022

A Formalization of Doob's Martingale Convergence Theorems in mathlib

We present the formalization of Doob's martingale convergence theorems i...
research
11/08/2013

A new stopping criterion for the mean shift iterative algorithm

The mean shift iterative algorithm was proposed in 2006, for using the e...
research
07/24/2018

Optional Stopping with Bayes Factors: a categorization and extension of folklore results, with an application to invariant situations

It is often claimed that Bayesian methods, in particular Bayes factor me...
research
05/09/2016

Synthesizing Probabilistic Invariants via Doob's Decomposition

When analyzing probabilistic computations, a powerful approach is to fir...

Please sign up or login with your details

Forgot password? Click here to reset