The paper introduces a novel approach to the verification of spatial properties for finite π-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 π-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).
Complementing this, a graph-based technique for the verification of spatial properties of finite π-calculus fragments (another process algebra) is introduced in REF .
Graphical Verification of a Spatial Logic for the π-calculus
Graph Transformation Verification and Concurrency, Electr. Notes in Theor. Comp. Sci
Computer Science