Abstract Interpretation of FIFO channels - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2005

Abstract Interpretation of FIFO channels


We address the analysis and the verification of communicating systems, which are systems built from sequential processes communicating via unbounded FIFO channels. We adopt the Abstract Interpretation approach to this problem, by defining approximate representations of sets of configuration of FIFO channels. In this paper we restrict our attention to the case where processes are finite-state processes and the alphabet of exchanged messages is finite. We first focus on systems with only one queue, for which we propose an abstract lattice based on regular languages, and we then generalize our proposal to systems with several queues. In particular, we define for these systems two abstract lattices, which are resp. non-relational and relational abstract lattices. We use those lattices for computing an over-approximation of the reachability set of a CFSM. Our experimental evaluation shows that, for some protocols, we obtain results that are as good as those obtained by exact methods founded on acceleration techniques.
Fichier principal
Vignette du fichier
RR-5784.pdf (376.21 Ko) Télécharger le fichier

Dates and versions

inria-00070237 , version 1 (19-05-2006)


  • HAL Id : inria-00070237 , version 1


Bertrand Jeannet, Thierry Jéron, Tristan Le Gall. Abstract Interpretation of FIFO channels. [Research Report] RR-5784, INRIA. 2005, pp.25. ⟨inria-00070237⟩
61 View
188 Download


Gmail Facebook Twitter LinkedIn More