Modular verification for almost-sure termination of probabilistic programs
نویسندگان
چکیده
منابع مشابه
Beyond Almost-Sure Termination
The aim of this paper is to argue that models in cognitive science based on probabilistic computation should not be restricted to those procedures that almost surely (with probability 1) terminate. There are several reasons to consider nonterminating procedures as candidate components of cognitive models. One theoretical reason is that there is a perfect correspondence between the enumerable se...
متن کاملAnalyzing Expected Outcomes and (Positive) Almost–Sure Termination of Probabilistic Programs is Hard
Probabilistic programs [1] are imperative sequential programs with the ability to toss a biased coin and proceed their computations depending on the outcome of the coin toss. They are used in security to describe cryptographic constructions (such as randomized encryption) and security experiments [2], in machine learning to describe distribution functions that are analyzed using Bayesian infere...
متن کاملAnalyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard
This paper considers the computational hardness of computing expected outcomes and deciding almost–sure termination of probabilistic programs. We show that deciding almost–sure termination and deciding whether the expected outcome of a program equals a given rational value is Π2–complete. Computing lower and upper bounds on the expected outcome is shown to be recursively enumerable and Σ2–compl...
متن کاملProving Positive Almost-Sure Termination
In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the ring of rules can be subject to some probabilistic laws. Considering rewrite rules subject to probabilities leads to numerous questions about the underlying notions and results. We focus here on the problem of termination of a set of probabilistic rewrite rules. A probabilistic rewrite s...
متن کاملOn the Hardness of Almost-Sure Termination
This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost–sure termination of probabilistic programs. It is shown that computing lower and upper bounds of expected outcomes is Σ 1– and Σ 0 2–complete, respectively. Deciding (universal) almost–sure termination as well as deciding whether the expected outcome of a program equals a gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2019
ISSN: 2475-1421
DOI: 10.1145/3360555