MORA – Automatic Generation of Moment-Based Invariants

03/05/2021
by   Ezio Bartocci, et al.
0

We introduce MORA, an automated tool for generating invariants of probabilistic programs. Inputs to MORA are so-called Prob-solvable loops, that is probabilistic programs with polynomial assignments over random variables and parametrized distributions. Combining methods from symbolic computation and statistics, MORA computes invariant properties over higher-order moments of loop variables, expressing, for example, statistical properties, such as expected values and variances, over the value distribution of loop variables.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2019

Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops

One of the main challenges in the analysis of probabilistic programs is ...
research
05/13/2022

Distribution Estimation for Probabilistic Loops

We present an algorithmic approach to estimate the value distributions o...
research
07/20/2023

Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs

We show that computing the strongest polynomial invariant for single-pat...
research
09/02/2021

A Reasoning Engine for the Gamification of Loop-Invariant Discovery

We describe the design and implementation of a reasoning engine that fac...
research
07/18/2020

Analysis of Bayesian Networks via Prob-Solvable Loops

Prob-solvable loops are probabilistic programs with polynomial assignmen...
research
05/24/2023

Automated Sensitivity Analysis for Probabilistic Loops

We present an exact approach to analyze and quantify the sensitivity of ...
research
06/12/2023

Exact and Approximate Moment Derivation for Probabilistic Loops With Non-Polynomial Assignments

Many stochastic continuous-state dynamical systems can be modeled as pro...

Please sign up or login with your details

Forgot password? Click here to reset