This is the moment for probabilistic loops

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 approach is fully automatic, meaning it does not rely on externally provided invariants or templates. We employ algebrai...

Full description

Bibliographic Details

Published in:	Proceedings of ACM on programming languages Vol. 6; no. OOPSLA2; pp. 1497 - 1525
Main Authors:	Moosbrugger, Marcel, Stankovič, Miroslav, Bartocci, Ezio, Kovács, Laura
Format:	Journal Article
Language:	English
Published:	New York, NY, USA ACM 31.10.2022
Subjects:	Computing methodologies Markov processes Mathematics of computing Random walks and Markov chains Symbolic and algebraic algorithms Theory of computation Higher Moments Distribution Recovery Linear Recurrences Probabilistic Programs
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!