T. Le Gall, B. Jeannet. Lattice automata: a representation of languages over an infinite alphabet, and some applications to verification. In The 14th International Static Analysis Symposium, SAS 2007, LNCS, Volume 4634, Pages 52-68, Kongens Lyngby, Denmark, August 2007.
Download paper:
Doi page
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
This paper proposes a new abstract domain for languages on infinite alphabets, which acts as a functor taking an abstract domain for a concrete alphabet and lift it to an abstract domain for words on this alphabet. The abstract representation is based on lattice automata, which are finite automata labeled by elements of an atomic lattice. We define a normal form, standard language operations and a widening operator for these automata. We apply this abstract lattice for the verification of symbolic communicating machines, and we discuss its usefulness for interprocedural analysis
Bertrand Jeannet http://www.irisa.fr/prive/bjeannet
@InProceedings{legall-jeannet-sas,
Author = {Le Gall, T. and Jeannet, B.},
Title = {Lattice automata: a representation of languages over an infinite alphabet, and some applications to verification},
BookTitle = {The 14th International Static Analysis Symposium, SAS 2007},
Volume = { 4634},
Pages = {52--68},
Series = {LNCS},
Address = {Kongens Lyngby, Denmark},
Month = {August},
Year = {2007}
}
Get EndNote Reference (.ref)
|
| VerTeCs
| Team
| Publications
| New Results
| Softwares
|
Irisa - Inria - Copyright 2005 © Projet VerTeCs |