Affiliation:
1. IST Austria, Austria
2. Ferdowsi University of Mashhad, Iran
3. Masaryk University, Czech Republic
Abstract
We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in a LexRSM not existing even for simple terminating programs. Our contributions are twofold. First, we introduce a generalization of LexRSMs that allows for some components to be negative. This standard feature of non-probabilistic termination proofs was hitherto not known to be sound in the probabilistic setting, as the soundness proof requires a careful analysis of the underlying stochastic process. Second, we present polynomial-time algorithms using our generalized LexRSMs for proving a.s. termination in broad classes of linear-arithmetic programs.
Funder
ERC CoG
Czech Science Foundation
European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science,Software
Reference82 articles.
1. Lexicographic ranking supermartingales: An efficient approach to termination of probabilistic programs;Agrawal Sheshansh;PACMPL,2018
2. Proceedings of the 17th International Conference on Static Analysis;Alias Christophe,2010
3. R. B. Ash and C. Doléans-Dade. 2000. Probability and Measure Theory. Harcourt/Academic Press. 99065669
4. Type-Based Complexity Analysis of Probabilistic Functional Programs
5. On probabilistic term rewriting
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献