Back to: FsmReg
FsmRegForm
AbbrName Timbuk
FullName Timbuk: A Tree Automata Library
ItemDesc Timbuk is a collection of tools for achieving proofs of reachability over Term Rewriting
Systems (TRS for short) and for manipulating Tree Automata. The tree automata we use
here are bottom-up non-deterministic finite tree automata (NFTA for short).

The Timbuk library provides three standalone tools and a bunch of Objective Caml [12]
functions for basic manipulation on Tree Automata, alphabets, terms, Term Rewriting Sys-
tems, etc.

APartOf

ContainsParts

HomePage www.irisa.fr/lande/genet/timbuk
Type FsmCompiler
ImplLanguage

Author Thomas Genet and Val´erie Viet Triem Tong

Copyright

License

References

Availability

ProviderName

RelatedWork

Evaluation

LatestVersion Version 2.0
Topic revision: r1 - 2008-10-23 - AnssiYliJyra
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2018 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback