Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata

Authors:
Ahmed Bouajjani;Peter Habermehl;Lukáš Holík;Tayssir Touili;Tomáš Vojnar
Affiliations:
LIAFA, CNRS and University Paris Diderot, France;LIAFA, CNRS and University Paris Diderot, France and LSV, ENS Cachan, CNRS, INRIA,;FIT, Brno University of Technology, Czech republic;LIAFA, CNRS and University Paris Diderot, France;FIT, Brno University of Technology, Czech republic
Venue:
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Year:
2008

Citing 8
Cited 11

Introduction to algorithms

Introduction to algorithms
Extrapolating Tree Transformations

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Abstract Regular Tree Model Checking

Electronic Notes in Theoretical Computer Science (ENTCS)
Improved algorithms for the automata-based approach to model-checking

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Computing simulations over tree automata: efficient techniques for reducing tree automata

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Abstract regular tree model checking of complex dynamic data structures

SAS'06 Proceedings of the 13th international conference on Static Analysis
Antichains: a new algorithm for checking universality of finite automata

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Simulation-Based iteration of tree transducers

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems

An Antichain Algorithm for LTL Realizability

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Fixpoint Guided Abstraction Refinement for Alternating Automata

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Strategy construction for parity games with imperfect information

Information and Computation
Fixed point guided abstraction refinement for alternating automata

Theoretical Computer Science
Parametric random generation of deterministic tree automata

Theoretical Computer Science
Weak inclusion for XML types

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Efficient inclusion checking on explicit and semi-symbolic tree automata

ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Antichain algorithms for finite automata

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
When simulation meets antichains: on checking language inclusion of nondeterministic finite (tree) automata

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
VATA: a library for efficient manipulation of non-deterministic tree automata

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
More anti-chain based refinement 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

We propose new antichain-based algorithms for checking universality and inclusion of nondeterministic tree automata (NTA). We have implemented these algorithms in a prototype tool and our experiments show that they provide a significant improvement over the traditional determinisation-based approaches. We use our antichain-based inclusion checking algorithm to build an abstract regular tree model checking framework based entirely on NTA. We show the significantly improved efficiency of this framework through a series of experiments with verifying various programs over dynamic linked tree-shaped data structures.