Lower Bounds for Possibly Divergent Probabilistic Programs-Reference-Cited by-同舟云学术

Lower Bounds for Possibly Divergent Probabilistic Programs

Published:2023-04-06 Issue:OOPSLA1 Volume:7 Page:696-726
ISSN:2475-1421
Container-title:Proceedings of the ACM on Programming Languages
language:en
Short-container-title:Proc. ACM Program. Lang.

Author:

Feng Shenghua¹^ORCID,Chen Mingshuai²^ORCID,Su Han¹^ORCID,Kaminski Benjamin Lucien³^ORCID,Katoen Joost-Pieter⁴^ORCID,Zhan Naijun¹^ORCID

Affiliation:

1. Institute of Software at Chinese Academy of Sciences, China / University of Chinese Academy of Sciences, China

2. Zhejiang University, China

3. Saarland University, Germany / University College London, UK

4. RWTH Aachen University, Germany

Abstract

We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish non-trivial lower bounds on, e.g., termination probabilities and expected values, for possibly divergent probabilistic loops, e.g., the well-known three-dimensional random walk on a lattice.

Funder

National Key Research and Development Program of China

National Natural Science Foundation of China

European Research Council

HORIZON EUROPE Marie Sklodowska-Curie Actions

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Link

https://dl.acm.org/doi/pdf/10.1145/3586051

Reference102 articles.

1. Erika Ábrahám , Bernd Becker , Christian Dehnert , Nils Jansen , Joost-Pieter Katoen , and Ralf Wimmer . 2014 . Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey . In SFM (LNCS , Vol. 8483). Springer, 65– 121 . Erika Ábrahám, Bernd Becker, Christian Dehnert, Nils Jansen, Joost-Pieter Katoen, and Ralf Wimmer. 2014. Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey. In SFM (LNCS, Vol. 8483). Springer, 65–121.

2. Alejandro Aguirre , Gilles Barthe , Justin Hsu , Benjamin Lucien Kaminski , Joost-Pieter Katoen , and Christoph Matheja . 2021 . A Pre-Expectation Calculus for Probabilistic Sensitivity . Proc. ACM Program. Lang., 5, POPL (2021), 1–28. Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, and Christoph Matheja. 2021. A Pre-Expectation Calculus for Probabilistic Sensitivity. Proc. ACM Program. Lang., 5, POPL (2021), 1–28.

3. Fast randomized consensus using shared memory

4. Proofs of randomized algorithms in Coq

5. Christel Baier and Joost-Pieter Katoen . 2008. Principles of Model Checking . MIT press . Christel Baier and Joost-Pieter Katoen. 2008. Principles of Model Checking. MIT press.