Abstract
Computing reachability probabilities is a fundamental problem in the analysis of randomized programs. This article aims at a comprehensive and comparative account of various martingale-based methods for over- and under-approximating reachability probabilities. Based on the existing works that stretch across different communities (formal verification, control theory, etc.), we offer a unifying account. In particular, we emphasize the role of order-theoretic fixed points—a classic topic in computer science—in the analysis of randomized programs. This leads us to two new martingale-based techniques, too. We also make an experimental comparison using our implementation of template-based synthesis algorithms for those martingales.
- Alessandro Abate, Joost-Pieter Katoen, John Lygeros, and Maria Prandini. 2010. Approximate model checking of stochastic hybrid systems. Eur. J. Cont. 16, 6 (2010), 624–641.Google Scholar
Cross Ref
- Sheshansh Agrawal, Krishnendu Chatterjee, and Petr Novotný. 2018. Lexicographic ranking supermartingales: An efficient approach to termination of probabilistic programs. Proc. ACM Prog. Lang. 2, POPL (2018), 34:1–34:32.Google Scholar
Digital Library
- Christophe Alias, Alain Darte, Paul Feautrier, and Laure Gonnord. 2010. Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs. In Proceedings of the 17th International Static Analysis Symposium, (SAS’10) (Lecture Notes in Computer Science), Radhia Cousot and Matthieu Martel (Eds.), Vol. 6337. Springer, 117–133. DOI:https://doi.org/10.1007/978-3-642-15769-1_8Google Scholar
Cross Ref
- Krzysztof R. Apt and Gordon D. Plotkin. 1986. Countable nondeterminism and random assignment. J. ACM 33, 4 (1986), 724–767. DOI:https://doi.org/10.1145/6490.6494Google Scholar
Digital Library
- André Arnold and Damian Niwiński. 2001. Rudiments of -Calculus. Elsevier.Google Scholar
- Martin Avanzini, Ugo Dal Lago, and Akihisa Yamada. 2018. On probabilistic term rewriting. In Proceedings of the International Symposium on Functional and Logic Programming (FLOPS’18) (Lecture Notes in Computer Science), John P. Gallagher and Martin Sulzmann (Eds.), Vol. 10818. Springer, 132–148.Google Scholar
Cross Ref
- Christel Baier and Joost-Pieter Katoen. 2008. Principles of Model Checking. The MIT Press.Google Scholar
Digital Library
- Dimitri P. Bertsekas and Steven E. Shreve. 2007. Stochastic Optimal Control: The Discrete-Time Case. Athena Scientific.Google Scholar
- Rastislav Bodík and Rupak Majumdar (Eds.). 2016. In Proceedings of the ACM SIGPLAN Symposium on Principles of Programming Languages. ACM.Google Scholar
- Aleksandar Chakarov and Sriram Sankaranarayanan. 2013. Probabilistic program analysis with martingales. In Proceedings of the International Conference on Computer Aided Verification (LNCS), Natasha Sharygina and Helmut Veith (Eds.), Vol. 8044. Springer, 511–526.Google Scholar
Cross Ref
- Aleksandar Chakarov, Yuen-Lam Voronin, and Sriram Sankaranarayanan. 2016. Deductive proofs of almost sure persistence and recurrence properties. In Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, (TACAS’16) (LNCS), Marsha Chechik and Jean-François Raskin (Eds.), Vol. 9636. Springer, 260–279.Google Scholar
Digital Library
- Krishnendu Chatterjee and Hongfei Fu. 2017. Termination of nondeterministic recursive probabilistic programs. CoRR abs/1701.02944 (2017).Google Scholar
- Krishnendu Chatterjee, Hongfei Fu, and Amir Kafshdar Goharshady. 2016. Termination analysis of probabilistic programs through Positivstellensatz’s. In Proceedings of the International Conference on Computer Aided Verification (LNCS), Swarat Chaudhuri and Azadeh Farzan (Eds.), Vol. 9779. Springer, 3–22.Google Scholar
Cross Ref
- Krishnendu Chatterjee, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. 2016. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. In Proceedings of the ACM SIGPLAN Symposium on Principles of Programming Languages.327–342.Google Scholar
Digital Library
- Krishnendu Chatterjee, Petr Novotný, and Dorde Zikelic. 2017. Stochastic invariants for probabilistic termination. In Proceedings of the ACM SIGPLAN Symposium on Principles of Programming Languages (POPL’17), Giuseppe Castagna and Andrew D. Gordon (Eds.). ACM, 145–160.Google Scholar
Digital Library
- Radhia Cousot and Patrick Cousot. 1979. Constructive versions of Tarski’s fixed point theorems. Pacific J. Math. 82, 1 (1979), 43–57.Google Scholar
Cross Ref
- Luis María Ferrer Fioriti and Holger Hermanns. 2015. Probabilistic termination: Soundness, completeness, and compositionality. In Proceedings of the 42nd SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (POPL’15), Sriram K. Rajamani and David Walker (Eds.). ACM, 489–501. DOI:https://doi.org/10.1145/2676726.2677001Google Scholar
Digital Library
- A. Makhorin. 2008. GLPK–GNU Linear Programming Kit. http://www.gnu.org/software/glpk/.Google Scholar
- Andrew D. Gordon, Thomas A. Henzinger, Aditya V. Nori, and Sriram K. Rajamani. 2014. Probabilistic programming. In Proceedings of the Conference on the Future of Software Engineering, (FOSE’14), James D. Herbsleb and Matthew B. Dwyer (Eds.). ACM, 167–181.Google Scholar
- Ichiro Hasuo, Shunsuke Shimizu, and Corina Cîrstea. 2016. Lattice-theoretic progress measures and coalgebraic model checking. In Proceedings of the ACM SIGPLAN Symposium on Principles of Programming Languages.. 718–732.Google Scholar
Digital Library
- Roger A. Horn and Charles R. Johnson. 2012. Matrix Analysis (2nd ed.). Cambridge University Press, New York, NY.Google Scholar
Digital Library
- Marcin Jurdzinski. 2000. Small progress measures for solving parity games. In Proceedings of the International Symposium on Theoretical Aspects of Computer Science (STACS’00) (LNCS), Horst Reichel and Sophie Tison (Eds.), Vol. 1770. Springer, 290–301.Google Scholar
Cross Ref
- Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, and Federico Olmedo. 2016. Weakest precondition reasoning for expected run-times of probabilistic programs. In Proceedings of the 25th European Symposium on Programming Languages and Systems, (ESOP’16), Held as Part of the European Joint Conferences on Theory and Practice of Software, (ETAPS’16) (Lecture Notes in Computer Science), Peter Thiemann (Ed.), Vol. 9632. Springer, 364–389.Google Scholar
Digital Library
- Joost-Pieter Katoen, Annabelle McIver, Larissa Meinicke, and Carroll C. Morgan. 2010. Linear-invariant generation for probabilistic programs: Automated support for proof-based methods. In Proceedings of the 17th International Symposium on Static Analysis (SAS’10). 390–406.Google Scholar
- Dexter Kozen. 1985. A probabilistic PDL. J. Comput. Syst. Sci. 30, 2 (1985), 162–178. DOI:https://doi.org/10.1016/0022-0000(85)90012-1Google Scholar
- Satoshi Kura, Natsuki Urabe, and Ichiro Hasuo. 2019. Tail probabilities for randomized program runtimes via martingales for higher moments. In Proceedings of the 25th International Conference, on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’19), Held as Part of the European Joint Conferences on Theory and Practice of Software, (ETAPS’19) (Lecture Notes in Computer Science), Tomás Vojnar and Lijun Zhang (Eds.), Vol. 11428. Springer, 135–153. DOI:https://doi.org/10.1007/978-3-030-17465-1_8Google Scholar
- Annabelle McIver and Carroll Morgan. 2004. Abstraction, Refinement and Proof for Probabilistic Systems (Monographs in Computer Science). SpringerVerlag.Google Scholar
Digital Library
- Annabelle McIver and Carroll Morgan. 2004. Developing and reasoning about probabilistic programs in pGCL. In Proceedings of the 1st Pernambuco Summer School on Software Engineering: Refinement Techniques in Software Engineering (PSSE’04) (LNCS), Ana Cavalcanti, Augusto Sampaio, and Jim Woodcock (Eds.), Vol. 3167. Springer, 123–155.Google Scholar
- Annabelle McIver, Carroll Morgan, Benjamin Lucien Kaminski, and Joost-Pieter Katoen. 2018. A new proof rule for almost-sure termination. Proc. ACM Prog. Lang. 2, POPL (2018), 33:1–33:28. DOI:https://doi.org/10.1145/3158121Google Scholar
Digital Library
- Frederick Mosteller. 2012. Fifty Challenging Problems in Probability with Solutions. Dover Publications.Google Scholar
- Arkadi Nemirovski and Cornelis Roos. 2008. Motzkin transposition theorem. Encyclopedia of Optimization (2nd edition), C. A. Floudas and P. M. Pardalos (Eds.). Springer, 235–2348. https://doi.org/10.1007/978-0-387-74759-0_405.Google Scholar
- Van Chan Ngo, Quentin Carbonneaux, and Jan Hoffmann. 2018. Bounded expectations: Resource analysis for probabilistic programs. In Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, (PLDI’18), Jeffrey S. Foster and Dan Grossman (Eds.). ACM, 496–512. DOI:https://doi.org/10.1145/3192366.3192394Google Scholar
Digital Library
- Stephen Prajna, Ali Jadbabaie, and George J. Pappas. 2004. Stochastic safety verification using barrier certificates. In Proceedings of the 43rd IEEE Conference on Decision and Control. IEEE, Piscataway, NJ, 929–934.Google Scholar
- Konrad Schmüdgen. 1991. The K-moment problem for compact semi-algebraic sets. Math. Ann. 289, 1 (01 Mar. 1991), 203–206.Google Scholar
- Alexander Schrijver. 1998. Theory of Linear and Integer Programming. Wiley.Google Scholar
Digital Library
- K. C. Toh, M. J. Todd, and R. H. Tutuncu, SDPT3–a Matlab software package for semidefinite programming. Optimization Methods and Software 11 (1999), 545–581.Google Scholar
- Antonis Papachristodoulou, James Anderson, Giorgio Valmorbida, Stephen Prajna, Pete Seiler, and Pablo A. Parrilo. 2013. SOSTOOLS Version 3.00 Sum of Squares Optimization Toolbox for MATLAB. CoRR abs/1310.4716.Google Scholar
- Jacob Steinhardt and Russ Tedrake. 2012. Finite-time regional verification of stochastic non-linear systems. Int. J. Robot. Res. 31, 7 (2012), 901–923.Google Scholar
Digital Library
- Toru Takisaka, Yuichiro Oyabu, Natsuki Urabe, and Ichiro Hasuo. 2018. Ranking and repulsing supermartingales for reachability in probabilistic programs. In Proceedings of the 16th International Symposium on Automated Technology for Verification and Analysis, (ATVA’18) (Lecture Notes in Computer Science), Shuvendu K. Lahiri and Chao Wang (Eds.), Vol. 11138. Springer, 476–493. DOI:https://doi.org/10.1007/978-3-030-01090-4_28Google Scholar
Cross Ref
- Alfred Tarski. 1951. A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley.Google Scholar
- Natsuki Urabe, Masaki Hara, and Ichiro Hasuo. 2017. Categorical liveness checking by corecursive algebras. In Proceedings of the ACM-IEEE Symposium on Logic in Computer Science (LICS’17). IEEE Computer Society, 1–12.Google Scholar
Cross Ref
- Moshe Y. Vardi. 1995. An automata-theoretic approach to linear temporal logic. In Proceedings of the Banff Higher Order Workshop (Lecture Notes in Computer Science), Faron Moller and Graham M. Birtwistle (Eds.), Vol. 1043. Springer, 238–266.Google Scholar
Index Terms
Ranking and Repulsing Supermartingales for Reachability in Randomized Programs
Recommendations
Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs
STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computingWe consider dynamic algorithms for maintaining Single-Source Reachability (SSR) and approximate Single-Source Shortest Paths (SSSP) on n-node m-edge directed graphs under edge deletions (decremental algorithms). The previous fastest algorithm for SSR ...
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
CCC '12: Proceedings of the 2012 IEEE Conference on Computational Complexity (CCC)This work presents a log-space reduction which compresses an $n$-vertex directed a cyclic graph with $m(n)$ sources embedded on a surface of genus $g(n)$, to a graph with $O(m(n)+g(n))$ vertices while preserving reach ability between a given pair of ...
Super-linear time-space tradeoff lower bounds for randomized computation
FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer ScienceWe prove the first time-space lower bound tradeoffs for randomized computation of decision problems. The bounds hold even in the case that the computation is allowed to have arbitrary probability of error on a small fraction of inputs. Our techniques ...






Comments