activity
20192026
most citedThis Is the Moment for Probabilistic Loops

29 citations · 36 across the 5 of their papers we have counts for

collaborators

7 papers

cs.CL2026

Content is What Remains: Invariant Speech Tokenization from Parallel Utterances

Laurin Wagner, Bernhard Thallinger, Miroslav Stankovic +1

Discrete speech tokenizers aim to disentangle semantic from acoustic information, yet targets from self-supervised learning (SSL) models like HuBERT retain non-linguistic variation…

stat.AP2022★ 7 cited

Moment-based Invariants for Probabilistic Loops with Non-polynomial Assignments

Andrey Kofnov, Marcel Moosbrugger, Miroslav Stankovič +2

We present a method to automatically approximate moment-based invariants of probabilistic programs with non-polynomial updates of continuous state variables to accommodate more com…

cs.PL2022

Solving Invariant Generation for Unsolvable Loops

Daneshvar Amrollahi, Ezio Bartocci, George Kenison +3

Automatically generating invariants, key to computer-aided analysis of probabilistic and deterministic programs and compiler optimisation, is a challenging open problem. Whilst the…

cs.PL2022★ 29 cited

This Is the Moment for Probabilistic Loops

Marcel Moosbrugger, Miroslav Stankovič, Ezio Bartocci +1

We present a novel static analysis technique to derive higher moments for program variables for a large class of probabilistic loops with potentially uncountable state spaces. Our…

cs.FL2021

MORA -- Automatic Generation of Moment-Based Invariants

Ezio Bartocci, Laura Kovacs, Miroslav Stankovic

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 poly…

cs.AI2020

Analysis of Bayesian Networks via Prob-Solvable Loops

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 invar…

cs.SC2019

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

Ezio Bartocci, Laura Kovács, Miroslav Stankovič

One of the main challenges in the analysis of probabilistic programs is to compute invariant properties that summarise loop behaviours. Automation of invariant generation is still…