A multiprocess network logic with temporal and spatial modalities
Journal of Computer and System Sciences
Fundamenta Informaticae - Special issue on graph transformations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Hyperedge replacement graph grammars
Handbook of graph grammars and computing by graph transformation
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Normal forms for algebras of connections
Theoretical Computer Science
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Spatial Logic for Querying Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
Manipulating trees with hidden labels
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
A temporal graph logic for verification of graph transformation systems
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Graph rewriting for the π-calculus
Mathematical Structures in Computer Science
Parallel and Sequential Independence for Borrowed Contexts
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Counterpart semantics for a second-order µ-calculus
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Adhesivity is not enough: local church-rosser revisited
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Counterpart Semantics for a Second-Order μ-Calculus
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
| Hi-index | 0.00 |
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.