# Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs

@inproceedings{Chatterjee2016AlgorithmicAO, title={Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs}, author={Krishnendu Chatterjee and Hongfei Fu and Petr Novotn{\'y} and Rouzbeh Hasheminezhad}, booktitle={POPL}, year={2016} }

- Published 2016 in POPL
DOI:10.1145/2837614.2837639

In this paper, we consider termination of probabilistic programs with real-valued variables. The questions concerned are: 1. qualitative ones that ask (i) whether the program terminates with probability 1 (almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); 2. quantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) to compute a bound B such that the probability to terminate after B steps… CONTINUE READING

Showing 1-10 of 10 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential