Graphical Encoding of a Spatial Logic for the pi -Calculus

This paper extends our graph-based approach to the verification of spatial properties of π-calculus specifications. The mechanism is based on an encoding for mobile calculi where each process is mapped into a graph (with interfaces) such that the denotation is fully abstract with respect to the usual structural congruence, i.e., two processes are equivalent exactly when the corresponding encodings yield isomorphic graphs. Behavioral and structural properties of π-calculus processes expressed in a spatial logic can then be verified on the graphical encoding of a process rather than on its textual representation. In this paper we introduce a modal logic for graphs and define a translation of spatial formulae such that a process verifies a spatial formula exactly when its graphical representation verifies the translated modal graph formula.

[1]  Reiko Heckel,et al.  Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach , 1997, Handbook of Graph Grammars.

[2]  Manfred Nagl,et al.  Applications of Graph Transformations with Industrial Relevance , 2004, Lecture Notes in Computer Science.

[3]  Vladimiro Sassone,et al.  Spatial Logics for Bigraphs , 2005, ICALP.

[4]  Luca Cardelli,et al.  A Spatial Logic for Querying Graphs , 2002, ICALP.

[5]  Luca Cardelli,et al.  A Spatial Logic for Concurrency , 2001, TACS.

[6]  Reiko Heckel,et al.  Graph Transformation for Verification and Concurrency , 2005 .

[7]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[8]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[9]  Andrea Corradini,et al.  A Static Analysis Technique for Graph Transformation Systems , 2001, CONCUR.

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

[11]  Fabio Gadducci,et al.  Term Graph Rewriting for the pi-Calculus , 2003, APLAS.

[12]  Andrew M. Pitts,et al.  A New Approach to Abstract Syntax with Variable Binding , 2002, Formal Aspects of Computing.

[13]  Luca Cardelli,et al.  Manipulating Trees with Hidden Labels , 2003, FoSSaCS.

[14]  Roberto Bruni,et al.  Normal forms for algebras of connection , 2002, Theor. Comput. Sci..

[15]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools , 1999 .

[16]  Francesca Rossi,et al.  Graph Processes , 1996, Fundam. Informaticae.

[17]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[18]  Arend Rensink.  The GROOVE Simulator: A Tool for State Space Generation , 2003, AGTIVE.

[19]  Bruno Courcelle,et al.  The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.

[20]  Luca Cardelli,et al.  A spatial logic for concurrency - II , 2004, Theor. Comput. Sci..

[21]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[22]  D. Galloway.  Should surgeons still sit an exit examination , 2005 .

[23]  John C. Reynolds,et al.  Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[24]  Fabio Gadducci,et al.  An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories , 1999, Appl. Categorical Struct..

[25]  Annegret Habel,et al.  Hyperedge Replacement, Graph Grammars , 1997, Handbook of Graph Grammars.

[26]  A. Prasad Sistla,et al.  A Multiprocess Network Logic with Temporal and Spatial Modalities , 1983, ICALP.

[27]  Andrea Corradini,et al.  A Temporal Graph Logic for Verification of Graph Transformation Systems , 2006, WADT.

[28]  Luís Caires.  Behavioral and Spatial Observations in a Logic for the pi-Calculus , 2004, FoSSaCS.

[29]  Dániel Varró,et al.  Automated formal verification of visual modeling languages by model checking , 2004, Software & Systems Modeling.

[30]  Brian Campbell,et al.  Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.

[31]  Fabio Gadducci,et al.  Graphical Verification of a Spatial Logic for the pi-calculus , 2006, Electron. Notes Theor. Comput. Sci..

[32]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[33]  R. Milner,et al.  Bigraphical Reactive Systems , 2001, CONCUR.

[34]  Arend Rensink,et al.  Towards model checking graph grammars , 2003 .

[35]  Luca Cardelli,et al.  A spatial logic for concurrency (part I) , 2003, Inf. Comput..

[36]  Barbara König,et al.  Augur - A Tool for the Analysis of Graph Transformation Systems , 2005, Bull. EATCS.

[37]  Luca Cardelli,et al.  TQL: a query language for semistructured data based on the ambient logic , 2004, Mathematical Structures in Computer Science.