Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
Result description
This report provides the full version of a CIAA'08 paper, in which we propose a new antichain-based algorithms for checking universality and inclusion of nondeterministic tree automata (NTA). We have implemented these algorithms in a prototype tooland 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 entirelyon 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.
Keywords
universalitytree automataantichainabstract regular tree model checking
The result's identifiers
Result code in IS VaVaI
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
Original language description
This report provides the full version of a CIAA'08 paper, in which we propose a new antichain-based algorithms for checking universality and inclusion of nondeterministic tree automata (NTA). We have implemented these algorithms in a prototype tooland 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 entirelyon 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.
Czech name
Testování univerzality stromových automatů založené na protiřetězcích
Czech description
Jedná se o úplnou verzi článku prezentovaného na CIAA'08, ve kterém byl navržen algoritmus pro testování univerzality stromových automatů postavený na protiřetězcích. Tento algoritmus byl implementován v rámci prototypového nástroje pro abstraktní regularní stromový model checking (ARTMC) a byla s ním provedena řada experimentů, ktere ukazují, že nový algoritmus se chová v praxi velice dobře. Zapojení tohoto algoritmu do ARTMC nástroje vedlo k jeho výraznému zefektivnění.
Classification
Type
A - Audiovisual production
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
GA102/07/0322: Advanced Formal Approaches in the Design and Verification of Computer-Based Systems
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2008
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
ISBN
—
Place of publication
—
Publisher/client name
—
Version
—
Carrier ID
—
Basic information
Result type
A - Audiovisual production
CEP
JC - Computer hardware and software
Year of implementation
2008