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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bouajjani, A., Habermehl, P., Holík, L., Touili, T., & Vojnar, T. (2008). Antichain-based universality and inclusion testing over nondeterministic finite tree automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5148 LNCS, pp. 57–67). https://doi.org/10.1007/978-3-540-70844-5_7
Mendeley helps you to discover research relevant for your work.