 |
Conference papers
A completion algorithm for lattice tree automata
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.
Keywords :
Tree automata
Algorithms
Computer software
Forestry
Integer programming
Java programming language
Model checking
Trees (mathematics)
Automata theory
Computer Programing
Computer Programs
Programing Languages
Robots
Regular tree
Java program
Integer arithmetic
Infinite state systems
Extended versions
Completion algorithms
Abstract domains
https://hal-cea.archives-ouvertes.fr/cea-01834984
Contributor : Léna Le Roy Connect in order to contact the contributor
Submitted on : Wednesday, July 11, 2018 - 10:02:34 AM
Last modification on : Monday, December 13, 2021 - 9:16:45 AM
Contributor : Léna Le Roy Connect in order to contact the contributor
Submitted on : Wednesday, July 11, 2018 - 10:02:34 AM
Last modification on : Monday, December 13, 2021 - 9:16:45 AM
Links full text
