Skip to Main content Skip to Navigation

Tree Regular Model Checking for Lattice-Based Automata

Thomas Genet 1 Tristan Le Gall 2, 3 Axel Legay 4 Valérie Murat 5 
1 CELTIQUE - Software certification with semantic analysis
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
4 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Tree Regular Model Checking (TRMC) is the name of a family of techniques for analyzing infinite-state systems in which states are represented by terms, and sets of states by Tree Automata (TA). The central problem in TRMC is to decide whether a set of bad states is reachable. The problem of computing a TA representing (an over-approximation of) the set of reachable states is undecidable, but efficient solutions based on completion or iteration of tree transducers exist. Unfortunately, the TRMC framework is unable to efficiently capture both the complex structure of a system and of some of its features. As an example, for JAVA programs, the structure of a term is mainly exploited to capture the structure of a state of the system. On the counter part, integers of the java programs have to be encoded with Peano numbers, which means that any algebraic operation is potentially represented by thousands of applications of rewriting rules. In this paper, we propose Lattice Tree Automata (LTAs), an extended version of tree automata whose leaves are equipped with lattices. LTAs allow us to represent possibly infinite sets of interpreted terms. Such terms are capable to represent complex domains and related operations in an efficient manner. We also extend classical Boolean operations to LTAs. Finally, as a major contribution, we introduce a new completion-based algorithm for computing the possibly infinite set of reachable interpreted terms in a finite amount of time.
Document type :
Complete list of metadata

Cited literature [32 references]  Display  Hide  Download
Contributor : Valérie Murat Connect in order to contact the contributor
Submitted on : Tuesday, March 19, 2013 - 3:51:25 PM
Last modification on : Saturday, June 25, 2022 - 7:45:44 PM
Long-term archiving on: : Thursday, June 20, 2013 - 4:26:35 PM


Files produced by the author(s)


  • HAL Id : hal-00687310, version 2


Thomas Genet, Tristan Le Gall, Axel Legay, Valérie Murat. Tree Regular Model Checking for Lattice-Based Automata. [Technical Report] RT-0424, INRIA. 2012, pp.33. ⟨hal-00687310v2⟩



Record views


Files downloads