%0 Conference Proceedings
%F sas07
%A Le Gall, T.
%A Jeannet, B.
%T Lattice automata: a representation of languages over an infinite alphabet, and some applications to verification
%B Static Analysis Symposium, SAS'07
%V 4634
%S LNCS
%X 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
%U http://pop-art.inrialpes.fr/people/bjeannet/publications/sas07.ps.gz
%8 August
%D 2007