T. Le Gall, B. Jeannet. Lattice automata: a representation of languages over an infinite alphabet, and some applications to verification. In Static Analysis Symposium, SAS'07, LNCS, Volume 4634, August 2007.
Download paper:
Gziped Postscript
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 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://pop-art.inrialpes.fr/people/bjeannet/
@InProceedings{sas07,
Author = {Le Gall, T. and Jeannet, B.},
Title = {Lattice automata: a representation of languages over an infinite alphabet, and some applications to verification},
BookTitle = {Static Analysis Symposium, SAS'07},
Volume = {4634},
Series = {LNCS},
Month = {August},
Year = {2007}
}
Get EndNote Reference (.ref)