Thomas Genet, et al.  Home/Search
Context
Related
| irisa.fr/lande/genet/timbu...Manual.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: irisa.fr/lande/genet/timbuk/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this documentation using ocamlweb [8]. In the following you will find one section for each main module: tree automaton, term, term rewriting systems, etc. To see an example showing how to call those functions from Taml, have a look to section 2.2. To see how to import modules and call those functions from some other Ocaml code see Taml main 51 Ocaml file: taml.ml or Timbuk mail Ocaml file: main.ml in the source distribution. Note that labels in function declarations are only used for clarity of ... (Update)
Similar documents (at the sentence level):
8.3%: , 26, 70, 146 - Variable Rhs Not (Correct)
Active bibliography (related documents): More All
0.3: Reachability Analysis over Term Rewriting Systems - Feuillade, Genet, Tong (2003) (Correct)
0.3: Rewriting for Cryptographic Protocol Verification - Genet, Klay (1999) (Correct)
0.2: Regular Sets of Descendants by some Rewrite Strategies - Pierre Ety Julie (2002) (Correct)
Similar documents based on text: More All
1.0: Reachability Analysis of Term Rewriting Systems with Timbuk - Genet, Tong (2001) (Correct)
0.9: Combining ISABELLE and Timbuk for Cryptographic Protocol.. - Oehl, Sinclair (2002) (Correct)
0.7: Combining Two Approaches for the Verification of.. - Oehl, Sinclair (2001) (Correct)
BibTeX entry: (Update)
@misc{ genet-timbuk,
author = "Thomas Genet and et al.",
title = "Timbuk - A Tree Automata Library",
url = "citeseer.ist.psu.edu/genet03timbuk.html" }
Citations (may not include all citations):353 Term Rewriting and All That (context) - Baader, Nipkow - 1998
322 Breaking and fixing the Needham-Schroeder public-key protoco.. - Lowe - 1996
102 Tree automata techniques and applications - Comon, Dauchet et al. - 2002
97 the security of public key protocols (context) - Dolev, Yao - 1983
36 Decidable approximations of sets of descendants and sets of .. - Genet - 1998
33 Decidable approximations of term rewriting systems (context) - Jacquemard - 1996
32 Tree generating regular systems (context) - Brainerd - 1969
25 Institut National de Recherche en Informatique et Automatiqu.. (context) - Leroy, Doligez et al. - 2000
20 Deterministic Tree Pushdown Automata and Monadic Tree Rewrit.. (context) - Salomaa - 1988
15 The theory of ground rewrite systems is decidable (context) - Dauchet, Tison - 1990
10 Bottom-up tree pushdown automata and rewrite systems (context) - Coquide, Dauchet et al. - 1991
9 Rewriting for Cryptographic Protocol Verification - Genet, Klay - 2000
1 Reachability Analysis over Term Rewriting Systems - Feuillade, Genet et al. - 2003
1 Regular Sets of Descendants for Constructor-based Rewrite Sy.. (context) - Rety - 1999
1 ocamlweb: a literate programming tool for Objective Caml (context) - Filiatre, Marche - 2000
Documents on the same site (http://www.irisa.fr/lande/genet/timbuk/): More
, 26, 70, 146 - Variable Rhs Not (Correct)
Combining ISABELLE and Timbuk for Cryptographic Protocol.. - Oehl, Sinclair (2002) (Correct)
Automatic Approximation for the Verification of.. - OEHL, CECE.. (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC