1. G. Feuillade, T. Genet, and V. Viet Triem Tong. Reachability Analysis over Term Rewriting Systems. Journal of Automated Reasoning, 33 (3-4):341-383, 2004. [WWW ] Keyword(s): Term Rewriting, Reachability, Tree Automata, Approximations, Verification, Timbuk, Abstract Interpretation. [Abstract] [bibtex-entry]



2. C.L. Hankin, D. Le Métayer, and D. Sands. Refining multiset transformers. Theoretical Computer Science, 1997. [WWW ] Keyword(s): program transformation, composition operator, parallelism, Gamma, chemical reaction. [Abstract] [bibtex-entry]

1. Y. Boichut and T. Genet. Feasible Trace Reconstruction for Rewriting Approximations.. In RTA, volume 4098 of LNCS, pages 123-135, 2006. Springer. [bibtex-entry]



2. G. Feuillade and T. Genet. Reachability in conditional term rewriting systems. In FTP'2003, International Workshop on First-Order Theorem Proving, volume 86 n. 1 of Electronic Notes in Theoretical Computer Science, June 2003. Elsevier. [WWW ] Keyword(s): Term Rewriting, Conditional Term Rewriting, Reachability, Tree Automata. [bibtex-entry]



3. T. Genet, Y.-M. Tang-Talpin, and V. Viet Triem Tong. Verification of Copy Protection Cryptographic Protocol using Approximations of Term Rewriting Systems. In In Proceedings of Workshop on Issues in the Theory of Security, 2003. [WWW ] Keyword(s): Cryptographic Protocol, Verification, Term Rewriting, Reachability, Approximation, Timbuk. [bibtex-entry]



4. T. Genet and Valérie Viet Triem Tong. Reachability Analysis of Term Rewriting Systems with \sl Timbuk. In 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, volume 2250 of Lectures Notes in Artificial Intelligence, pages 691--702, 2001. Springer Verlag. [WWW ] Keyword(s): Timbuk, Term Rewriting, Reachability, Tree Automata, Descendants, Verification. [Abstract] [bibtex-entry]



5. T. Genet and F. Klay. Rewriting for Cryptographic Protocol Verification. In Proceedings 17th International Conference on Automated Deduction, volume 1831 of Lecture Notes in Artificial Intelligence, 2000. Springer-Verlag. [WWW ] Keyword(s): Cryptographic Protocol, Verification, Term Rewriting, Reachability, Approximation, Timbuk. [Abstract] [bibtex-entry]



6. P. Fradet and D. Le Métayer. Type checking for a multiset rewriting language. In Proc. of the LOMAPS workshop on Analysis and Verification of Multiple-agent Languages, volume 1192 of LNCS, pages 126-140, 1996. [WWW ] Keyword(s): multiset rewriting, graph grammars, type checking, invariant, verification. [Abstract] [bibtex-entry]

1. G. Feuillade, T. Genet, and V. Viet Triem Tong. Reachability Analysis over Term Rewriting Systems. Technical report RR-4970, INRIA, 2003. [WWW ] Keyword(s): Term Rewriting, Reachability, Tree Automata, Approximations, Verification, Timbuk, Abstract Interpretation. [bibtex-entry]



2. T. Genet and V. Viet Triem Tong. Proving Negative Conjectures on Equational Theories using Induction and Abstract Interpretation. Technical report RR-4576, INRIA, 2002. [WWW ] Keyword(s): Equational theories, proof by induction, abstract interpretation, rewriting. [bibtex-entry]



3. Thomas Genet and Valérie Viet Triem Tong. Reachability Analysis of Term Rewriting Systems with \sl Timbuk (extended version). Technical Report RR-4266, INRIA, 2001. [WWW ] [Abstract] [bibtex-entry]



4. T. Genet and F. Klay. Rewriting for Cryptographic Protocol Verification (extended version). Technical Report 3921, INRIA, 2000. [WWW ] [Abstract] [bibtex-entry]

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html