Automatic verification of parameterized networks of processes

David Lesens (1, 2) , Nicolas Halbwachs (2) , Pascal Raymond (2)

1 AST - Astrium Space Transportation
2 VERIMAG - IMAG - VERIMAG

This paper describes a method to verify safety properties of parameterized networks of processes defined by network grammars. The method is based on the construction of a network invariant, defined as a fixpoint. We propose heuristics, based on Cousot's extrapolation techniques (widening), which often allow suitable invariants to be automatically constructed. We successively consider linear and binary tree networks. These techniques have been implemented in a verification tool, and several non-trivial examples are presented.

Mots clés: Model-checking; Parameterized networks; Synchronous observers; Widening

Domaines: Systèmes embarqués; Langage de programmation [cs.PL]

David Lesens, Nicolas Halbwachs, Pascal Raymond. Automatic verification of parameterized networks of processes. Theoretical Computer Science, 2001, 256 (1-2), pp.113-144. ⟨hal-00198649⟩