Tree regular model checking: A simulation-based approach, The Journal of Logic and Algebraic Programming, vol.69, issue.1-2, pp.93-121, 2006. ,
DOI : 10.1016/j.jlap.2006.02.001
Term Rewriting and All That, 1998. ,
Towards an Efficient Implementation of Tree Automata Completion, AMAST'08, 2008. ,
DOI : 10.1007/978-3-540-79980-1_6
URL : https://hal.archives-ouvertes.fr/inria-00304010
Rewriting Approximations for Fast Prototyping of Static Analyzers, In: RTA. LNCS, vol.4533, pp.48-62, 2007. ,
DOI : 10.1007/978-3-540-73449-9_6
URL : https://hal.archives-ouvertes.fr/hal-00463418
Automatic Approximation for the Verification of Cryptographic Protocols, Proc. AVIS'2004, 2004. ,
Abstract Regular Tree Model Checking, Infinity'05, pp.37-48, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00156828
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures, SAS'06, pp.52-70, 2006. ,
DOI : 10.1007/11823230_5
URL : https://hal.archives-ouvertes.fr/hal-00150139
Extrapolating Tree Transformations, In: CAV. LNCS, vol.2404, 2002. ,
DOI : 10.1007/3-540-45657-0_46
URL : https://hal.archives-ouvertes.fr/hal-00161115
On Computing Reachability Sets of Process Rewrite Systems, In: RTA. LNCS, vol.3467, pp.484-499, 2005. ,
DOI : 10.1007/978-3-540-32033-3_35
URL : https://hal.archives-ouvertes.fr/hal-00161108
Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems, Proc. of RULE'09, 2009. ,
DOI : 10.4204/EPTCS.21.9
URL : https://hal.archives-ouvertes.fr/hal-00780491
Certifying a Tree Automata Completion Checker, IJCAR'08, 2008. ,
DOI : 10.1007/978-3-540-71070-7_43
URL : https://hal.archives-ouvertes.fr/inria-00258275
All About Maude, A High-Performance Logical Framework, of Lecture Notes in Computer Science, 2007. ,
Handbook of Theoretical Computer Science, Ch. 6: Rewrite Systems, pp.244-320, 1990. ,
Regular hedge model checking, pp.213-230, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00161094
Reachability Analysis over Term Rewriting Systems, Journal of Automated Reasoning, vol.37, issue.1?2, pp.3-4, 2004. ,
DOI : 10.1007/s10817-004-6246-0
URL : https://hal.archives-ouvertes.fr/inria-00071609
Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation, LPAR'08, 2008. ,
DOI : 10.1007/978-3-540-89439-1_47
Tree Pattern Rewriting Systems, ATVA'08, pp.332-346, 2008. ,
DOI : 10.1016/S0020-0190(01)00337-4
URL : https://hal.archives-ouvertes.fr/hal-00344551
Decidable approximations of sets of descendants and sets of normal forms, Proc. 9th RTA Conf, pp.151-165, 1998. ,
DOI : 10.1007/BFb0052368
URL : https://hal.archives-ouvertes.fr/inria-00073364
Rewriting for Cryptographic Protocol Verification, Proc. 17th CADE Conf, 2000. ,
DOI : 10.1007/10721959_21
URL : https://hal.archives-ouvertes.fr/inria-00072731
Equational approximations for tree automata completion, Journal of Symbolic Computation, vol.45, issue.5, 2009. ,
DOI : 10.1016/j.jsc.2010.01.009
URL : https://hal.archives-ouvertes.fr/inria-00495405
Verification of Copy Protection Cryptographic Protocol using Approximations of Term Rewriting Systems, 2003. ,
Reachability Analysis of Term Rewriting Systems with timbuk of LNAI, Proc. 8th LPAR Conf, pp.691-702, 2001. ,
Timbuk ? a Tree Automata Library, IRISA / Université de Rennes, vol.1, 2001. ,
Regular tree languages and rewrite systems, Fundamenta Informaticae, vol.24, pp.157-175, 1995. ,
URL : https://hal.archives-ouvertes.fr/inria-00538882
Closure of Hedge-Automata Languages by Hedge Rewriting, RTA'08, pp.157-171, 2008. ,
DOI : 10.1007/978-3-540-70590-1_11
URL : https://hal.archives-ouvertes.fr/inria-00329803
Flow analysis of lazy higher-order functional programs, Theoretical Computer Science, vol.375, issue.1-3, pp.1-3, 2007. ,
DOI : 10.1016/j.tcs.2006.12.030
Equational Abstractions, Proc. 19th CADE Conf, pp.2-16, 2003. ,
Automatic computation of data set definitions, Information Processing, vol.68, pp.456-461, 1969. ,
A Verification Technique Using Term Rewriting Systems and Abstract Interpretation, Proc. 15th RTA Conf, pp.119-133, 2004. ,
DOI : 10.1007/978-3-540-25979-4_9