• MONA

  • Referenced in 116 articles [sw06170]
  • years, including formula reductions, DAGification, guided tree automata, three-valued logic, eager minimization, BDD-based...
  • Timbuk

  • Referenced in 46 articles [sw06351]
  • Term Rewriting Systems and for manipulating Tree Automata (bottom-up non-deterministic finite tree automata ... fully new version of the tree automata completion engine used for reachability analysis. Older Timbuk ... Caml functions for basic manipulation on Tree Automata, alphabets, terms, Term Rewriting Systems...
  • XDuce

  • Referenced in 53 articles [sw12436]
  • foundations in the theory of regular tree automata, and present a complete formal definition...
  • Slide

  • Referenced in 16 articles [sw28542]
  • SLIDE - Separation Logic with Inductive Definitions. Automata-based entailment checking for Separation Logic with Inductive ... inductive definitions of recursive data structures (lists, trees, and beyond). Basic features: Sound and complete ... Built on top of the VATA tree automata library...
  • VATA

  • Referenced in 7 articles [sw09917]
  • efficient manipulation of non-deterministic tree automata. In this paper, we present VATA, a versatile ... efficient open-source tree automata library applicable, e.g., in formal verification. The library supports both ... symbolic encoding of non-deterministic finite tree automata and provides efficient implementation of standard operations ... semi-symbolic encoding is intended for tree automata with large alphabets. For storing their transition...
  • MTBDD

  • Referenced in 5 articles [sw12873]
  • efficient manipulation of non-deterministic tree automata. In this paper, we present VATA, a versatile ... efficient open-source tree automata library applicable, e.g., in formal verification. The library supports both ... symbolic encoding of non-deterministic finite tree automata and provides efficient implementation of standard operations ... semi-symbolic encoding is intended for tree automata with large alphabets. For storing their transition...
  • biXid

  • Referenced in 9 articles [sw12667]
  • phases use a variant of finite tree automata for performing a one-pass scan...
  • Tree Automata

  • Referenced in 3 articles [sw28835]
  • Tree Automata: This work presents a machine-checked tree automata library for Standard-ML, OCaml ... structures like RB-trees. The available algorithms for non-deterministic automata include membership query, reduction ... contains a formalization of the class of tree-regular languages and its closure properties under...
  • Forest FIRE

  • Referenced in 3 articles [sw00304]
  • report on a toolkit of tree automata and algorithms for tree acceptance, pattern matching ... www.fastar.org}, contains about 50 tree algorithms and automata constructions...
  • RAHFT

  • Referenced in 2 articles [sw24485]
  • clauses using abstract interpretation and finite tree automata. We present Rahft (Refinement of Abstraction ... Horn clauses using Finite Tree automata), an abstraction refinement tool for verifying safety properties ... domain, a tool for manipulating finite tree automata and various solvers for reasoning about constraints...
  • YakYak

  • Referenced in 2 articles [sw07540]
  • turned into canonical attribute grammars through tree automata calculations. YakYak is implemented as a preprocessor ... which the transitions of the calculated tree automata are merged into the action code...
  • LETHAL

  • Referenced in 2 articles [sw09918]
  • library for working with finite tree and hedge automata. It supports a great variety ... started quickly. The concept of finite tree automata is to examine regular languages of trees...
  • TravMC2

  • Referenced in 1 article [sw20008]
  • order model checking for alternating parity tree automata. Higher-order model checking is the problem ... checking safety properties specified using trivial tree automata i.e. Buechi tree automata all of whose ... supports properties specified using alternating parity tree automata (or equivalently monadic second order logic...
  • Ultimate Kojak

  • Referenced in 4 articles [sw23308]
  • recursive programs using nested word automata and nested (tree) interpolants...
  • LISA

  • Referenced in 1 article [sw30492]
  • algorithm for translating datatypes into tree automata. We have implemented LISA, a prototype system based...
  • PatMaN

  • Referenced in 4 articles [sw29584]
  • implements a non-deterministic automata matching algorithm on a keyword tree of the search strings...
  • TravMC

  • Referenced in 1 article [sw09396]
  • order model checking - the model checking of trees generated by higher-order recursion schemes (HORS ... problem for deterministic trivial automata: does the automaton accept every tree in the tree language...
  • GBDD

  • Referenced in 1 article [sw15451]
  • using finite automata. Recently, these techniques have also been applied to finite trees...
  • Regexp

  • Referenced in 1 article [sw31124]
  • paper From Regular Expressions to Deterministic Automata, G. Berry and R. Sethi. Theoretical Computer Science ... uses smart data structures (Hash-consing, Patricia Trees), thanks to Jean-Christophe Filliâtre. Documentation...
  • ATLAS

  • Referenced in 194 articles [sw00056]
  • This paper describes the Automatically Tuned Linear Algebra...