Abstract
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 algebraic techniques based on linear recurrences and introduce program transformations to simplify probabilistic programs while preserving their statistical properties. We develop power reduction techniques to further simplify the polynomial arithmetic of probabilistic programs and define the theory of moment-computable probabilistic loops for which higher moments can precisely be computed. Our work has applications towards recovering probability distributions of random variables and computing tail probabilities. The empirical evaluation of our results demonstrates the applicability of our work on many challenging examples.
Funder
Vienna Science and Technology Fund
European Research Council
Austrian Science Fund
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Reference60 articles.
1. Christel Baier and Joost-Pieter Katoen . 2008. Principles of model checking . MIT Press . ISBN 978-0-262-02649-9 Christel Baier and Joost-Pieter Katoen. 2008. Principles of model checking. MIT Press. ISBN 978-0-262-02649-9
2. Data-Driven Invariant Learning for Probabilistic Programs
3. Synthesizing Probabilistic Invariants via Doob’s Decomposition
4. Mathematics of Program Construction
5. Foundations of Probabilistic Programming
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献