TY  - JOUR
N1  - Proceedings of the Workshop on Graph Transformation for Verification and Concurrency (GT-VC 2005).
ID  - eprints162
EP  - 46
SN  - 1571-0661
N2  - The paper introduces a novel approach to the verification of spatial properties for finite [pi]-calculus specifications. The mechanism is based on a recently proposed graphical encoding for mobile calculi: Each process is mapped into a (ranked) graph, 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 the same graph). Spatial properties for reasoning about the behavior and the structure of pi-calculus processes are then expressed in a logic introduced by Caires, and they are verified on the graphical encoding of a process, rather than on its textual representation. More precisely, the graphical presentation allows for providing a simple and easy to implement verification algorithm based on the graphical encoding (returning true if and only if a given process verifies a given spatial formula).

AV  - public
TI  - Graphical Verification of a Spatial Logic for the Graphical Verification of a Spatial Logic for the pi-calculus
KW  - Process calculi; spatial logic; verification
UR  - http://www.sciencedirect.com/science/article/B75H1-4K1F7W6-3/2/605472a7fe33cd3afca8144a4387ea26
VL  - 154
A1  - Gadducci, Fabio
A1  - Lluch-Lafuente, Alberto
PB  - Elsevier
SP  - 31
Y1  - 2006///
IS  - 2
JF  - Electronic Notes in Theoretical Computer Science
ER  -