Probabilistic Output Analyses for Deterministic Programs — Reusing Existing Non-probabilistic Analyses

01/20/2020
by   Maja Hanne Kirkeby, et al.
0

We consider reusing established non-probabilistic output analyses (either forward or backwards) that yield over-approximations of a program's pre-image or image relation, e.g., interval analyses. We assume a probability measure over the program input and present two techniques (one for forward and one for backward analyses) that both derive upper and lower probability bounds for the output events. We demonstrate the most involved technique, namely the forward technique, for two examples and compare their results to a cutting-edge probabilistic output analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2017

Combining Forward and Backward Abstract Interpretation of Horn Clauses

Alternation of forward and backward analyses is a standard technique in ...
research
07/18/2023

Newtonian Program Analysis of Probabilistic Programs

Due to their quantitative nature, probabilistic programs pose non-trivia...
research
07/12/2019

Verified Self-Explaining Computation

Common programming tools, like compilers, debuggers, and IDEs, crucially...
research
08/02/2020

Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations

Analyzing probabilistic programs and randomized algorithms are classical...
research
04/06/2022

Guaranteed Bounds for Posterior Inference in Universal Probabilistic Programming

We propose a new method to approximate the posterior distribution of pro...
research
07/23/2020

Dataflow Analysis With Prophecy and History Variables

Leveraging concepts from state machine refinement proofs, we use prophec...
research
01/22/2015

Output-Sensitive Adaptive Metropolis-Hastings for Probabilistic Programs

We introduce an adaptive output-sensitive Metropolis-Hastings algorithm ...

Please sign up or login with your details

Forgot password? Click here to reset