Sound and complete certificates for quantitative termination analysis of probabilistic programs
We consider the quantitative problem of obtaining lower-bounds on the probability of termination of a given non-deterministic probabilistic program. Specifically, given a non-termination threshold p∈[0,1], we aim for certificates proving that the program terminates with probability at least 1−p. The...
Saved in:
Main Authors: | CHATTERJEE, Krishnendu, GOHARSHADY, Amir Kafshdar, MEGGENDORFER, Tobias, ZIKELIC, Dorde |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2022
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/9076 https://ink.library.smu.edu.sg/context/sis_research/article/10079/viewcontent/sound.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Quantitative bounds on resource usage of probabilistic programs
by: CHATTERJEE, Krishnendu, et al.
Published: (2026) -
Sound and complete witnesses for template-based verification of LTL properties on polynomial programs
by: CHATTERJEE, Krishnendu, et al.
Published: (2024) -
Stochastic invariants for probabilistic termination
by: CHATTERJEE, Krishnendu, et al.
Published: (2017) -
Equivalence and similarity refutation for probabilistic programs
by: CHATTERJEE, Krishnendu, et al.
Published: (2025) -
Proving non-termination by program reversal
by: CHATTERJEE, Krishnendu, et al.
Published: (2021)