• Timbuk

  • Referenced in 47 articles [sw06351]
  • Tree Automata (bottom-up non-deterministic finite tree automata) Timbuk and reachability analysis...
  • RAHFT

  • Referenced in 6 articles [sw24485]
  • Horn 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 ... abstract domain, a tool for manipulating finite tree automata and various solvers for reasoning about...
  • biXid

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

  • Referenced in 7 articles [sw09917]
  • versatile and efficient open-source tree automata library applicable, e.g., in formal verification. The library ... semi-symbolic encoding of non-deterministic finite tree automata and provides efficient implementation of standard...
  • MTBDD

  • Referenced in 5 articles [sw12873]
  • versatile and efficient open-source tree automata library applicable, e.g., in formal verification. The library ... semi-symbolic encoding of non-deterministic finite tree automata and provides efficient implementation of standard...
  • LETHAL

  • Referenced in 2 articles [sw09918]
  • Java library for working with finite tree and hedge automata. It supports a great variety ... property evaluations. More advanced concepts like tree homomorphisms and transducers are also supported. Additionally ... started quickly. The concept of finite tree automata is to examine regular languages of trees...
  • libVATA

  • Referenced in 1 article [sw33005]
  • efficient manipulation with non-deterministic finite (tree) automata. libvata is a highly optimised non-deterministic ... finite tree automata library. The main focus of the library is to be used ... several formal verification techniques using tree automata, e.g., in the context of verification of programs ... used for finite word automata (which are, basically, unary trees...
  • GBDD

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

  • Referenced in 2 articles [sw32880]
  • approach to the use of the Finite State Automata for morphology in inflectional languages ... means of simple operations on n-ary trees. This approach has been implemented...
  • TravMC

  • Referenced in 2 articles [sw09396]
  • trees generated by higher-order recursion schemes (HORS) - is a natural generalisation of finite-state ... problem for deterministic trivial automata: does the automaton accept every tree in the tree language...
  • ATLAS

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

  • Referenced in 402 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • Coq

  • Referenced in 1906 articles [sw00161]
  • Coq is a formal proof management system. It...
  • FMona

  • Referenced in 3 articles [sw00303]
  • We present a generic tool, called FMona, for...
  • GAP

  • Referenced in 3221 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • gfun

  • Referenced in 144 articles [sw00344]
  • The gfun package provides tools for determining and...
  • gmp

  • Referenced in 289 articles [sw00363]
  • GMP is a free library for arbitrary precision...
  • Isabelle

  • Referenced in 719 articles [sw00454]
  • Isabelle is a generic proof assistant. It allows...
  • LANGAGE

  • Referenced in 39 articles [sw00501]
  • LANGAGE: A Maple package for automaton characterization of...
  • Magma

  • Referenced in 3363 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...