 |
|
|
|
| HAL: hal-00198649, version 1 |
| Detailed view |  Export this paper |
|
|
| Theoretical Computer Science 256, 1-2 (2001) 113-144 |
|
|
|
|
| Automatic verification of parameterized networks of processes |
|
|
| David Lesens 1, 2Nicolas Halbwachs 2 |
|
|
| (2001-04-06) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Astrium Space Transportation (AST) |
|
|
|
ASTRIUM |
|
|
| 2: | VERIMAG (VERIMAG - IMAG) |
|
|
|
CNRS : UMR5104 – Université Joseph Fourier - Grenoble I – Institut National Polytechnique de Grenoble (INPG) |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Embedded Systems Computer Science/Programming Languages |
|
|
| Model-checking – Parameterized networks – Synchronous observers – Widening |
|
|
|
|
|
| hal-00198649, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00198649 | |
| oai:hal.archives-ouvertes.fr:hal-00198649 | |
| From: Pascal Raymond | |
| Submitted on: Monday, 17 December 2007 16:36:27 | |
| Updated on: Monday, 17 December 2007 20:31:41 | |
