A completion algorithm for lattice tree automata - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

A completion algorithm for lattice tree automata

(1, 2) , (3) , (1, 4) , (1, 2)
1
2
3
4

Abstract

When dealing with infinite-state systems, Regular Tree Model Checking approaches may have some difficulties to represent infinite sets of data. We propose Lattice Tree Automata, an extended version of tree automata to represent complex data domains and their related operations in an efficient manner. Moreover, we introduce a new completion-based algorithm for computing the possibly infinite set of reachable states in a finite amount of time. This algorithm is independent of the lattice making it possible to seamlessly plug abstract domains into a Regular Tree Model Checking algorithm. As a first instance, we implemented a completion with an interval abstract domain. We provide some experiments showing that this implementation permits to scale up regular tree model-checking of Java programs dealing with integer arithmetics.

Dates and versions

cea-01834984 , version 1 (11-07-2018)

Identifiers

Cite

Thomas Genet, Tristan Le Gall, Axel Legay, Valérie Murat. A completion algorithm for lattice tree automata. CIAA 2013 - 18th International Conference on Implementation and Application of Automata, Jul 2013, Halifax, NS, Canada. pp.134-145, ⟨10.1007/978-3-642-39274-0_13⟩. ⟨cea-01834984⟩
55 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More