%0 Conference Proceedings
%F LJJ06
%A Legall, T.
%A Jeannet, B.
%A Jéron, T.
%T Verification of Communication Protocols Using Abstract Interpretation of {FIFO} queues
%B Algebraic Methodology and Software Technology, AMAST '06
%V 4019
%S LNCS
%X We address the verification of communication protocols or distributed systems that can be modeled by Communicating Finite-State Machines(CFSMs), i.e. a set of sequential machines communicating via unbounded FIFO channels. Unlike most related works based on acceleration techniques, we propose to apply the Abstract Interpretation approach to such systems, which consists in using approximated representations of sets of configurations. We show that the use of regular languages together with an extrapolation operator provides a simple and elegant method for the analysis of CFSMs, which is moreover often as accurate as related works, and in some cases more expressive. Last, when the system has several queues, our method can be implemented both as an attribute-independend analysis or as a more precise (but also more costly) attribute-dependent analysis
%U http://pop-art.inrialpes.fr/people/bjeannet/publications/amast06.pdf
%8 July
%D 2006