Verifying Qualitative Properties of Probabilistic Programs

In this chapter, we present procedures for checking linear temporal logic and automata specifications of sequential and concurrent probabilistic programs. We follow two different approaches: For LTL and sequential probabilistic programs, our method proceeds in a tableau style fashion, while the remaining procedures are based on automata theory.

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

[2]  A. Prasad Sistla,et al.  Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach , 1983, POPL '83.

[3]  Faron Moller,et al.  Logics for Concurrency , 1996, Lecture Notes in Computer Science.

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

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

[6]  John G. Kemeny,et al.  Finite Markov Chains. , 1960 .

[7]  Edmund M. Clarke,et al.  Formal Methods: State of the Art and Future Directions Working Group Members , 1996 .

[8]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[9]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[10]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[11]  Simon L. Peyton Jones,et al.  Imperative functional programming , 1993, POPL '93.

[12]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[13]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[14]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[15]  Micha Sharir,et al.  Probabilistic temporal logics for finite and bounded models , 1984, STOC '84.

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

[17]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

[18]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[19]  Saharon Shelah,et al.  Reasoning with Time and Chance , 1982, Inf. Control..

[20]  Pierre Wolper.  Temporal Logic Can Be More Expressive , 1983, Inf. Control..