Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification

DOI10.1007/978-3-540-74061-2_4zbMath1211.68234OpenAlexW1490661426MaRDI QIDQ3611994

Tristan Le Gall, Bertrand Jeannet

Publication date: 3 March 2009

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74061-2_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Static Analysis of Communicating Processes Using Symbolic Transducers ⋮ Quantitative static analysis of communication protocols using abstract Markov chains

This page was built for publication: Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification