Analysis of Dynamic Process Networks

We formulate a method to compute global invariants of dynamic process networks. In these networks, inter-process connectivity may be altered by an adversary at any point in time. Dynamic networks serve as models for ad-hoc and sensor-network protocols. The analysis combines elements of compositional reasoning, symmetry reduction, and abstraction. Together, they allow a small "cutoff" network to represent arbitrarily large networks. A compositional invariant computed on the small network generalizes to a parametric invariant of the shape "for all networks and all processes: property p holds of each process and its local neighborhood." We illustrate this method by showing how to compute useful invariants for a simple dining philosophers protocol, and the latest version of the ad-hoc routing protocol AODV version 2.

[1]  Ahmed Bouajjani,et al.  A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes , 2007, TACAS.

[2]  Bengt Jonsson,et al.  Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols , 2008, TACAS.

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

[4]  Thomas Wahl,et al.  Reducing Model Checking of the Few to the One , 2006, ICFEM.

[5]  Orna Grumberg,et al.  Network Grammars, Communication Behaviors and Automatic Verification , 1989, Automatic Verification Methods for Finite State Systems.

[6]  Stan Ratliff,et al.  Dynamic MANET On-demand (AODVv2) Routing , 2013 .

[7]  David L. Dill,et al.  Counter-Example Based Predicate Discovery in Predicate Abstraction , 2002, FMCAD.

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

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

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

[11]  Amir Pnueli,et al.  Symbolic Model Checking with Rich ssertional Languages , 1997, CAV.

[12]  Richard Banach,et al.  Book Review: "Concurrency Verification: Introduction to Compositional and Non-compositional Methods" by Willem-Paul de Roever, Frank de Boer, Ulrich Hanneman, Jozef Hooman, Yassine Lakhnech, Mannes Poel and Job Zwiers (eds.) , 2003, J. Log. Comput..

[13]  Giorgio Delzanno,et al.  Verification of Ad Hoc Networks with Node and Communication Failures , 2012, FMOODS/FORTE.

[14]  Zarrin Langari,et al.  Symmetry for the Analysis of Dynamic Systems , 2011, NASA Formal Methods.

[15]  Edsger W. Dijkstra,et al.  Predicate Calculus and Program Semantics , 1989, Texts and Monographs in Computer Science.

[16]  Kedar S. Namjoshi,et al.  Uncovering Symmetries in Irregular Process Networks , 2013, VMCAI.

[17]  Giorgio Delzanno,et al.  Parameterized Verification of Safety Properties in Ad Hoc Network Protocols , 2011, PACO.

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

[19]  Jozef Hooman,et al.  Concurrency Verification: Introduction to Compositional and Noncompositional Methods , 2001, Cambridge Tracts in Theoretical Computer Science.

[20]  Annabelle McIver,et al.  A rigorous analysis of AODV and its variants , 2012, MSWiM '12.

[21]  Kedar S. Namjoshi,et al.  Local Symmetry and Compositional Verification , 2012, VMCAI.

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

[23]  Carl A. Gunter,et al.  Formal verification of standards for distance vector routing protocols , 2002, JACM.

[24]  Giorgio Delzanno,et al.  On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks , 2012, FSTTCS.

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

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

[27]  Patrick Cousot,et al.  Automatic synthesis of optimal invariant assertions: Mathematical foundations , 1977 .

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

[29]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.