The probabilistic termination tool amber

DOI10.1007/s10703-023-00424-zarXiv2107.13072WikidataQ124212462 ScholiaQ124212462MaRDI QIDQ6145021

Ezio Bartocci, Marcel Moosbrugger, Laura Kovács, Joost-Pieter Katoen

Publication date: 8 January 2024

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.13072

zbMATH Keywords

martingalesrecurrence equationsasymptotic boundsprobabilistic programsalmost sure termination

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• Analysis of Bayesian networks via prob-solvable loops
• Inferring expected runtimes of probabilistic integer programs using expected sizes
• Automated termination analysis of polynomial probabilistic programs
• Probabilistic Termination
• On the Hardness of Almost–Sure Termination
• Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
• Probability
• Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
• A note on exact solutions of the logistic map
• Foundations of Probabilistic Programming
• Termination Analysis of Probabilistic Programs with Martingales
• Stochastic invariants for probabilistic termination
• Term Rewriting and Applications
• New approaches for almost-sure termination of probabilistic programs

This page was built for publication: The probabilistic termination tool amber