Automatic verification of parameterized networks of processes - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2001

Automatic verification of parameterized networks of processes

Nicolas Halbwachs
  • Function : Author
  • PersonId : 844681
Pascal Raymond

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.
Fichier principal
Vignette du fichier
tcs01.pdf (473.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00198649 , version 1 (17-12-2007)

Identifiers

  • HAL Id : hal-00198649 , version 1

Cite

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⟩
132 View
119 Download

Share

Gmail Facebook Twitter LinkedIn More