A uniform deductive approach for parameterized protocol safety

Authors:
Jean-Francois Couchot;Alain Giorgetti;Nikolai Kosmatov
Affiliations:
University of Franche-Comté, Besançon, France;University of Franche-Comté, Besançon, France;University of Franche-Comté, Besançon, France
Venue:
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Year:
2005

Citing 4
Cited 0

Constraint-Based Verification of Client-Server Protocols

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Symbolic Model Checking with Rich ssertional Languages

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Decidability of invariant validation for paramaterized systems

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a uniform verification method of safety properties for classes of parameterized protocols. Properties like mutual exclusion or cache coherence are automatically verified for any number of similar processes communicating by broadcast and rendezvous. The protocols are specified in a language of generalized substitutions on array data structures. Sets of states are expressed by first-order formulae with equality. Predecessors are computed by an iterative semi-algorithm. Reaching an initial state or the fixpoint is shown to be decidable and an original decision procedure is provided. As a running example, the MESI protocol illustrates this approach. Experimental results show its applicability to various properties and protocol classes.