A completion algorithm for lattice tree automata

Authors:
Thomas Genet;Tristan Le Gall;Axel Legay;Valérie Murat
Affiliations:
INRIA/IRISA, Rennes, France;LIST, Centre de recherche de Saclay, CEA, France;INRIA/IRISA, Rennes, France;INRIA/IRISA, Rennes, France
Venue:
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Year:
2013

Citing 15
Cited 0

Term rewriting and all that

Term rewriting and all that
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract Rewriting with Concrete Operations

RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Regular Tree Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Extrapolating Tree Transformations

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Reachability Analysis over Term Rewriting Systems

Journal of Automated Reasoning
Fuzzy tree automata

Fuzzy Sets and Systems
Structural Presburger digit vector automata

Theoretical Computer Science
Approximation-based tree regular model-checking

Nordic Journal of Computing
Equational approximations for tree automata completion

Journal of Symbolic Computation
Lattice automata

VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Rewriting approximations for fast prototyping of static analyzers

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Quantitative refinement for weighted modal transition systems

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Lattice automata: a representation for languages on infinite alphabets, and some applications to verification

SAS'07 Proceedings of the 14th international conference on Static Analysis
Equational abstraction refinement for certified tree regular model checking

ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering

Quantified Score

Hi-index	0.00

Visualization

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.