Block Me If You Can! - Context-Sensitive Parameterized Verification

We present a method for automatic verification of systems with a parameterized number of communicating processes, such as mutual exclusion protocols or agreement protocols. To that end, we present a powerful abstraction framework that uses an efficient and precise symbolic encoding of (infinite) sets of configurations. In particular, it generalizes downward-closed sets that have successfully been used in earlier approaches to parameterized verification. We show experimentally the efficiency of the method, on various examples, including a fine-grained model of Szymanski’s mutual exclusion protocol, whose correctness, to the best of our knowledge, has not been proven automatically by any other existing methods.

[1]  Giorgio Delzanno.  Verification of Consistency Protocols via Infinite-Stae Symbolic Model Checking , 2000, FORTE.

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

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

[4]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

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

[6]  Parosh Aziz Abdulla,et al.  Regular Model Checking Made Simple and Efficient , 2002, CONCUR.

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

[8]  Alain Finkel,et al.  On the verification of broadcast protocols , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[9]  Giorgio Delzanno.  Automatic Verification of Parameterized Cache Coherence Protocols , 2000, CAV.

[10]  Kedar S. Namjoshi,et al.  Symmetry and Completeness in the Analysis of Parameterized Systems , 2007, VMCAI.

[11]  Pierre Ganty,et al.  A Complete Abstract Interpretation Framework for Coverability Properties of Wsts , 2006 .

[12]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[13]  Karsten Stahl,et al.  Parameterized Verification of a Cache Coherence Protocol: Safety and Liveness , 2002, VMCAI.

[14]  Ahmed Bouajjani,et al.  Abstract Regular Model Checking , 2004, CAV.

[15]  Parosh Aziz Abdulla,et al.  Approximated Context-Sensitive Analysis for Parameterized Verification , 2009, FMOODS/FORTE.

[16]  Parosh Aziz Abdulla,et al.  Handling Parameterized Systems with Non-atomic Global Conditions , 2008, VMCAI.

[17]  Pierre Wolper,et al.  Iterating Transducers in the Large (Extended Abstract) , 2003, CAV.

[18]  Parosh Aziz Abdulla,et al.  All for the Price of Few , 2013, VMCAI.

[19]  Parosh Aziz Abdulla,et al.  All for the Price of Few ( Parameterized Verification through View Abstraction ) , 2012 .

[20]  Amir Pnueli,et al.  Symbolic model checking with rich assertional languages , 2001, Theor. Comput. Sci..

[21]  Parosh Aziz Abdulla,et al.  Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems) , 2007, TACAS.

[22]  David Lee,et al.  Formal Techniques for Distributed Systems, Joint 11th IFIP WG 6.1 International Conference FMOODS 2009 and 29th IFIP WG 6.1 International Conference FORTE 2009, Lisboa, Portugal, June 9-12, 2009. Proceedings , 2009, FMOODS/FORTE.

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

[24]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[25]  Giorgio Delzanno,et al.  Symbolic Representation of Upward-Closed Sets , 2000, TACAS.

[26]  Parosh Aziz Abdulla,et al.  Well (and Better) Quasi-Ordered Transition Systems , 2010, The Bulletin of Symbolic Logic.

[27]  Boleslaw K. Szymanski.  A simple solution to Lamport's concurrent programming problem with linear wait , 1988, ICS '88.

[28]  Yassine Lakhnech,et al.  Iterating transducers , 2001, J. Log. Algebraic Methods Program..

[29]  Helmut Veith,et al.  Environment Abstraction for Parameterized Verification , 2006, VMCAI.

[30]  Tayssir Touili.  Regular Model Checking using Widening Techniques , 2001, Electron. Notes Theor. Comput. Sci..

[31]  Jean-François Raskin,et al.  Expand, Enlarge and Check... Made Efficient , 2005, CAV.

[32]  Kousha Etessami,et al.  A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

[33]  Giorgio Delzanno,et al.  Covering sharing trees: a compact data structure for parameterized verification , 2004, International Journal on Software Tools for Technology Transfer.

[34]  Daniel Kroening,et al.  Dynamic Cutoff Detection in Parameterized Concurrent Programs , 2010, CAV.

[35]  A. Prasad Sistla,et al.  Reasoning about systems with many processes , 1992, JACM.