Analysis of Bayesian Networks via Prob-Solvable Loops

no code implementations • 18 Jul 2020 • Ezio Bartocci, Laura Kovács, Miroslav Stankovič

Prob-solvable loops are probabilistic programs with polynomial assignments over random variables and parametrised distributions, for which the full automation of moment-based invariant generation is decidable.

Aligator.jl - A Julia Package for Loop Invariant Generation

1 code implementation • 16 Aug 2018 • Andreas Humenberger, Maximilian Jaroschek, Laura Kovács

We describe the Aligator. jl software package for automatically generating all polynomial invariants of the rich class of extended P-solvable loops with nested conditionals.

Symbolic Computation

Invariant Generation for Multi-Path Loops with Polynomial Assignments

1 code implementation • 11 Jan 2018 • Andreas Humenberger, Maximilian Jaroschek, Laura Kovács

The results show the efficiency of our approach.

Programming Languages Symbolic Computation

Automated Generation of Non-Linear Loop Invariants Utilizing Hypergeometric Sequences

1 code implementation • 8 May 2017 • Andreas Humenberger, Maximilian Jaroschek, Laura Kovács

We present a new approach for automatically generating all polynomial invariants of a class of such programs.

Symbolic Computation