Automatic verification of parameterized networks of processes

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.
Document type :
Journal articles
Theoretical Computer Science, Elsevier, 2001, 256 (1-2), pp.113-144
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00198649
Contributor : Pascal Raymond <>
Submitted on : Monday, December 17, 2007 - 4:36:27 PM
Last modification on : Monday, December 17, 2007 - 8:31:41 PM
Document(s) archivé(s) le : Monday, April 12, 2010 - 8:12:52 AM

Files

tcs01.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00198649, version 1

Collections

Citation

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

Share

Metrics

Record views

151

Document downloads

73