legall07

T. Le Gall, B. Jeannet. Analysis of Communicating Infinite State Machines using Lattice Automata. Research Report IRISA, No 1839, March 2007.

Download [help]

Download paper: Adobe portable document (pdf)

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic

Abstract

Communication protocols can be formally described by the Communicating Finite-State Machines (CFSM) model. This model is expressive, but not expressive enough to deal with complex protocols that involve structured messages encapsulating integers or lists of integers. This is the reason why we propose an extension of this model : the Symbolic Communicating Machines (SCM). We also propose an approximate reachability analysis method, based on lattice automata. Lattice automata are finite automata, the transitions of which are labeled with elements of an atomic lattice. We tackle the problem of the determinization as well as the definition of a widening operator for these automata. We also show that lattice automata are useful for the interprocedural analysis

Contact

Bertrand Jeannet http://www.irisa.fr/prive/bjeannet

BibTex Reference

@TechReport{legall07,
   Author = {Le Gall, T. and Jeannet, B.},
   Title = {Analysis of Communicating Infinite State Machines using Lattice Automata},
   Number = {1839},
   Institution = {IRISA},
   Month = {March},
   Year = {2007}
}

EndNote Reference [help]

Get EndNote Reference (.ref)