P^5 : Planner-less Proofs of Probabilistic Parameterized Protocols

Liveness of many probabilistic parameterized protocols are proven by first crafting a family of sequences of “good"random draws, thus, in effect “de-probabilizing" the system, and then proving the system just as one would for a non-probabilistic parameterized system. The family of “good"random draws (known in different names, such as “planner" and “strategy") is often an intricate piece of machinery, arising from the need to reason about a parameterized Markov Decision Process (MDP). In effect, it represents a parameterized strategy for an infinite game played between a probabilistic player and a non-deterministic adversary.

[1]  Alon Itai,et al.  Symmetry breaking in distributive networks , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[2]  Maria Gradinariu Potop-Butucaru,et al.  Memory space requirements for self-stabilizing leader election protocols , 1999, PODC '99.

[3]  Micha Sharir,et al.  Termination of Probabilistic Concurrent Program , 1983, TOPL.

[4]  Amir Pnueli,et al.  Control and data abstraction: the cornerstones of practical formal verification , 2000, International Journal on Software Tools for Technology Transfer.

[5]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[6]  Kedar S. Namjoshi,et al.  Automatic Verification of Parameterized Synchronous Systems (Extended Abstract) , 1996, CAV.

[7]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[8]  Krzysztof R. Apt,et al.  Limits for Automatic Verification of Finite-State Concurrent Systems , 1986, Inf. Process. Lett..

[9]  Michael O. Rabin,et al.  The choice coordination problem , 1982, Acta Informatica.

[10]  Amir Pnueli,et al.  Automatic Verification of Probabilistic Free Choice , 2002, VMCAI.

[11]  Alon Itai,et al.  Symmetry breaking in distributed networks , 1990, Inf. Comput..

[12]  Vineet Kahlon,et al.  Reducing Model Checking of the Many to the Few , 2000, CADE.

[13]  Javier Esparza,et al.  Proving Termination of Probabilistic Programs Using Patterns , 2012, CAV.

[14]  Ted Herman,et al.  Probabilistic Self-Stabilization , 1990, Information Processing Letters.

[15]  Amos Israeli,et al.  Token management schemes and random walks yield self-stabilizing mutual exclusion , 1990, PODC '90.

[16]  Amir Pnueli,et al.  Automatic Deductive Verification with Invisible Invariants , 2001, TACAS.

[17]  Kedar S. Namjoshi,et al.  Reasoning about rings , 1995, POPL '95.

[18]  Daniel Lehmann,et al.  On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem , 1981, POPL '81.

[19]  Amir Pnueli,et al.  Parameterized Verification by Probabilistic Abstraction , 2003, FoSSaCS.

[20]  Amir Pnueli,et al.  Probabilistic Verification , 1993, Information and Computation.

[21]  Amir Pnueli,et al.  Liveness with (0, 1, infty)-Counter Abstraction , 2002, CAV.

[22]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[23]  Amir Pnueli,et al.  Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System , 1984, Theor. Comput. Sci..

[24]  Amir Pnueli,et al.  Verification by Augmented Finitary Abstraction , 2000, Inf. Comput..

[25]  Amir Pnueli,et al.  On the extremely fair treatment of probabilistic algorithms , 1983, STOC.

[26]  Philipp Rümmer,et al.  Liveness of Randomised Parameterised Systems under Arbitrary Schedulers , 2016, CAV.

[27]  Kenneth L. McMillan,et al.  A Compositional Rule for Hardware Design Refinement , 1997, CAV.

[28]  Amir Pnueli,et al.  Parameterized Verification with Automatically Computed Inductive Assertions , 2001, CAV.

[29]  Micha Sharir,et al.  Termination of probabilistic concurrent programs: (extended abstract) , 1982, POPL '82.

[30]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[31]  Amir Pnueli,et al.  Verification of multiprocess probabilistic protocols , 2005, Distributed Computing.