Specification and Verification of Dynamic Communication Systems

Dynamic communication systems (DCS) are complex because of their unboundedness in several dimensions. They have an unbounded and changing number of objects, a dynamically changing communication topology and unbounded message queues for asynchronous communication. We present a specification language for DCS that captures these features but is still amenable for formal verification. The verification of relevant properties of DCS is demonstrated using a combination of model-checking and abstract interpretation. Our approach is illustrated using the application domain of car platoons

[1]  Pierre Wolper,et al.  The Power of QDDs (Extended Abstract) , 1997, SAS.

[2]  Eran Yahav,et al.  Verifying Temporal Heap Properties Specified via Evolution Logic , 2006, Log. J. IGPL.

[3]  Kenneth L. McMillan,et al.  A methodology for hardware verification using compositional model checking , 2000, Sci. Comput. Program..

[4]  Reinhard Wilhelm,et al.  Parametric shape analysis via 3-valued logic , 1999, POPL '99.

[5]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[6]  Bernd Westphal,et al.  Live and let die: LSC based verification of UML models , 2005, Sci. Comput. Program..

[7]  Hassan Gomaa,et al.  Designing concurrent, distributed, and real-time applications with UML , 2000, ICSE.

[8]  David L. Dill,et al.  Better verification through symmetry , 1996, Formal Methods Syst. Des..

[9]  James H. Aylor,et al.  Computer for the 21st Century , 1999, Computer.

[10]  Arnaud Venet,et al.  Automatic Determination of Communication Topologies in Mobile Systems , 1998, SAS.

[11]  Patrick Cousot,et al.  Abstract interpretation , 1996, CSUR.

[12]  Amir Pnueli,et al.  A discrete-time UML semantics for concurrency and communication in safety-critical applications , 2005, Sci. Comput. Program..

[13]  Reinhard Wilhelm,et al.  Analysis of Dynamic Communicating Systems by Hierarchical Abstraction , 2006, Software Verification: Infinite-State Model Checking and Static Program Analysis.

[14]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[15]  Tiziano Villa,et al.  VIS: A System for Verification and Synthesis , 1996, CAV.

[16]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[17]  Flemming Nielson,et al.  Higher-order concurrent programs with finite communication topology (extended abstract) , 1994, POPL '94.

[18]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[19]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[20]  Sonia R. Sachs,et al.  Design Of Platoon Maneuver Protocols For IVHS , 1991 .

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

[22]  Arend Rensink,et al.  Who is pointing When to Whom: On Model-Checking Pointer Structures , 2003 .

[23]  Bernd Westphal,et al.  On the Expressive Power of Live Sequence Charts , 2006, Program Analysis and Compilation.

[24]  David Harel,et al.  LSCs: Breathing Life into Message Sequence Charts , 1999, Formal Methods Syst. Des..

[25]  Bengt Jonsson,et al.  Eliminating Queues from RT UML Model Representations , 2002, FTRTFT.

[26]  John Zahorjan,et al.  The challenges of mobile computing , 1994, Computer.

[27]  Per Johansson,et al.  Wireless ad hoc networking—The art of networking without a network , 2000 .

[28]  Bernd Westphal,et al.  Relating LSC Specifications to UML models , 2007 .

[29]  Reinhard Wilhelm,et al.  Parametric shape analysis via 3-valued logic , 2002, TOPL.

[30]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[31]  Robert P. Kurshan,et al.  Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach , 2014 .

[32]  Fei Xie,et al.  Integration of model checking into software development processes , 2004 .

[33]  Bernd Westphal.  LSC Verification for UML Models with Unbounded Creation and Destruction , 2006, Electron. Notes Theor. Comput. Sci..

[34]  Bernd Westphal,et al.  The Rhapsody UML Verification Environment , 2004, Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004..

[35]  J. Davenport.  Editor , 1960 .