Attributes | Values |
---|
rdf:type
| |
rdfs:seeAlso
| |
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 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.
- 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 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. (en)
|
Title
| - Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
- Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata (en)
|
skos:prefLabel
| - Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
- Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata (en)
|
skos:notation
| - RIV/00216305:26230/08:PU78079!RIV10-MSM-26230___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(GA102/07/0322), Z(MSM0021630528)
|
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216305:26230/08:PU78079
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - universality, tree automata, antichain, abstract regular tree model checking (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...i/riv/kodPristupu
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Holík, Lukáš
- Vojnar, Tomáš
- Habermehl, Peter
- Bouajjani, Ahmed
- Touili, Tayssir
|
http://linked.open...n/vavai/riv/zamer
| |
http://localhost/t...ganizacniJednotka
| |