Log in to save to my catalogue

Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic P...

Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic P...

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_crossref_primary_10_1145_3174800

Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs

About this item

Full title

Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs

Publisher

New York, NY, USA: ACM

Journal title

ACM transactions on programming languages and systems, 2018-05, Vol.40 (2), p.1-45, Article 7

Language

English

Formats

Publication information

Publisher

New York, NY, USA: ACM

More information

Scope and Contents

Contents

In this article, we consider the termination problem of probabilistic programs with real-valued variables. The questions concerned are: 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); and quantitative ones that as...

Alternative Titles

Full title

Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_crossref_primary_10_1145_3174800

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_crossref_primary_10_1145_3174800

Other Identifiers

ISSN

0164-0925

E-ISSN

1558-4593

DOI

10.1145/3174800

How to access this item