VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata

Lengál, Ondřej; Šimáček, Jiří; Vojnar, Tomáš

doi:10.1007/978-3-642-28756-5_7

Cited by 33 publications

(25 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In both cases, we conduct the experiments on a MacBook pro 2.4GHz Intel Core i7, with 4GB of memory, running OS X Lion (10.7.4). We use our OCaml implementation [7] for HK, HKC, and HKC', while we use the libvata C++ library [21] for AC and AC'. 1 (To our knowledge, libvata is the most efficient implementation currently available for these algorithms, even though this library was designed for tree automata rather than plain NFA.…”

Section: Experimental Assessmentmentioning

confidence: 99%

Checking NFA equivalence with bisimulations up to congruence

Bonchi¹,

PousDamien²

2013

SIGPLAN Not.

View full text Add to dashboard Cite

We introduce bisimulation up to congruence as a technique for proving language equivalence of non-deterministic finite automata. Exploiting this technique, we devise an optimisation of the classical algorithm by Hopcroft and Karp [18]. We compare our approach to the recently introduced antichain algorithms, by analysing and relating the two underlying coinductive proof methods. We give concrete examples where we exponentially improve over antichains; experimental results moreover show non negligible improvements.

show abstract

Section: Experimental Assessmentmentioning

confidence: 99%

Checking NFA equivalence with bisimulations up to congruence

Bonchi¹,

PousDamien²

2013

SIGPLAN Not.

View full text Add to dashboard Cite

show abstract

“…We use VATA Library [24], a tool that implements the antichain based algorithm for checking language inclusion of (tree and word) automata [23]. The results are obtained on a dual core laptop PC with 2GB of RAM.…”

Section: Methodsmentioning

confidence: 99%

“…We prove strict serializability and abort consistency by language inclusion using recent non trivial automata based techniques [23], [24] that can establish (or refute) in seconds language inclusion for automata with tens of thousands of states.…”

Section: Introductionmentioning

confidence: 99%

Verifying Safety and Liveness for the FlexTM Hybrid Transactional Memory

Abdulla¹,

Dwarkadas²,

Rezine³

et al. 2013

Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE), 2013

View full text Add to dashboard Cite

Abstract-We consider the verification of safety (strict serializability and abort consistency) and liveness (obstruction and livelock freedom) for the hybrid transactional memory framework FLEXTM. This framework allows for flexible implementations of transactional memories based on an adaptation of the MESI coherence protocol. FLEXTM allows for both eager and lazy conflict resolution strategies. Like in the case of Software Transactional Memories, the verification problem is not trivial as the number of concurrent transactions, their size, and the number of accessed shared variables cannot be a priori bounded. This complexity is exacerbated by aspects that are specific to hardware and hybrid transactional memories. Our work takes into account intricate behaviours such as cache line based conflict detection, false sharing, invisible reads or non-transactional instructions. We carry out the first automatic verification of a hybrid transactional memory and establish, by adopting a small model approach, challenging properties such as strict serializability, abort consistency, and obstruction freedom for both an eager and a lazy conflict resolution strategies. We also detect an example that refutes livelock freedom. To achieve this, our prototype tool makes use of the latest antichain based techniques to handle systems with tens of thousands of states.

show abstract

“…They have many applications in model checking [3,7], term rewriting [11] and related areas of formal software verification, e.g., shape analysis [13]. Several software packages for manipulating tree automata have been developed, e.g., Timbuk [4], Autowrite [11] and libvata [16] (on which other verification tools, like Forester [17], are based).…”

Section: Introductionmentioning

confidence: 99%

“…We implemented our algorithm as an extension of minotaut (source code available [5]), a module of the tree automata library libvata [16] where the Heavy algorithm is provided. The experiments described above were performed on a large collection of automata from applications of libvata in shape analysis, as well as on different classes of randomly generated tree automata.…”

Section: Introductionmentioning

confidence: 99%

Reducing Nondeterministic Tree Automata by Adding Transitions

Almeida

2016

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We introduce saturation of nondeterministic tree automata, a technique that adds new transitions to an automaton while preserving its language. We implemented our algorithm on minotaut -a module of the tree automata library libvata that reduces the size of automata by merging states and removing superfluous transitions -and we show how saturation can make subsequent merge and transition-removal operations more effective. Thus we obtain a Ptime algorithm that reduces the size of tree automata even more than before. Additionally, we explore how minotaut alone can play an important role when performing hard operations like complementation, allowing to both obtain smaller complement automata and lower computation times. We then show how saturation can extend this contribution even further. We tested our algorithms on a large collection of automata from applications of libvata in shape analysis, and on different classes of randomly generated automata.

show abstract

VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata

Cited by 33 publications

References 18 publications

Checking NFA equivalence with bisimulations up to congruence

Checking NFA equivalence with bisimulations up to congruence

Verifying Safety and Liveness for the FlexTM Hybrid Transactional Memory

Reducing Nondeterministic Tree Automata by Adding Transitions

Contact Info

Product

Resources

About