New approaches for almost-sure termination of probabilistic programs

DOI10.1007/978-3-030-02768-1_11zbMath1519.68052arXiv1806.06683OpenAlexW2808151598MaRDI QIDQ6166145

Hongfei Fu, Mingzhang Huang, Krishnendu Chatterjee

Publication date: 2 August 2023

Published in: Programming Languages and Systems (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (3)

The probabilistic termination tool amber ⋮ Automated termination analysis of polynomial probabilistic programs ⋮ Inferring expected runtimes of probabilistic integer programs using expected sizes

This page was built for publication: New approaches for almost-sure termination of probabilistic programs