Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S0304-3975(00)00104-3 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
Parameterized networks,automatic verification,Widening,parameterized network,Synchronous observers,Model-checking | Journal | 256 |
Issue | ISSN | Citations |
1-2 | Theoretical Computer Science | 7 |
PageRank | References | Authors |
0.59 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Lesens | 1 | 173 | 11.16 |
| Nicolas Halbwachs | 2 | 3957 | 426.43 |
| Pascal Raymond | 3 | 567 | 53.53 |