Quantifying uncertainty in probabilistic loops without sampling: a fully automated approach

DOI10.1007/978-3-031-72621-7_1MaRDI QIDQ7405565zbMATH OpenFDO

Authors Ezio Bartocci

Publication date 2024

Full work available at URL https://doi.org/10.1007/978-3-031-72621-7_1

zbMATH Keywords

moment-based invariantsprobabilistic programsprobabilistic reasoning

Mathematics Subject Classification ID

Probabilistic graphical models (62H22) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cites work

• (Un)solvable loop analysis
• Analysis of Bayesian networks via prob-solvable loops
• Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
• Computing polynomial program invariants
• Distribution estimation for probabilistic loops
• Exact and approximate moment derivation for probabilistic loops with non-polynomial assignments
• Linear-invariant generation for probabilistic programs: automated support for proof-based methods
• Moment-based analysis of Bayesian network properties
• Moment-based invariants for probabilistic loops with non-polynomial assignments
• Solving invariant generation for unsolvable loops
• Statistical probabilistic model checking with a focus on time-bounded properties
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations

This page was built for publication: Quantifying uncertainty in probabilistic loops without sampling: a fully automated approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7405565)