.. Model-checking-régulier-et-transducteurs, 57 3.2.1 Model-Checking régulier avec automates de mots : Regular Model- Checking, p.57

R. Fonctions, 69 3.3.1 Problématique et exemple fil rouge 69 3.3.2 Fusion d'états par équivalence de langage 71 3.3.3 Fusion d'états par équivalence de prédicats Autres fonctions d'abstractions de l'outil, p.76

.. Application-concrète-À-l-'analyse-de-programme, 92 3.5.1 Traduction exacte de la sémantique

C. Et-ouverture-sur-les-contributions........, Ils ne savaient pas que c'était impossible, alors ils l'ont fait

M. .. Chanter, Avoir l'oeil qui regarde bien, la voix qui vibre, Mettre, quand il vous plaît, son feutre de travers, Pour un oui, pour un non, se battre, ? ou faire un vers Travailler sans souci de gloire ou de fortune, A tel voyage, auquel on pense, dans la lune ! N'écrire jamais rien qui de soi ne sortît, Et modeste, d'ailleurs, se dire : « Mon petit, Sois satisfait des fleurs, des fruits, même des feuilles Si c'est dans ton jardin à toi que tu les cueilles ! » Puis, s'il advient d'un peu triompher, par hasard, Ne pas être obligé d'en rien rendre à César, Vis-à-vis de soi-même en garder le mérite, pp.peut-être

. Bibliographieabdulla, Parameterized verification of infinite-state processes with global conditions, CAV, 2007.

. Abdulla, Parameterized Tree Systems, 2008.
DOI : 10.1016/S0304-3975(00)00103-1

. Abdulla, Regular Tree Model Checking, Computer Aided Verification, 14th International Conference, CAV 2002 Proceedings, volume 2404 of Lecture Notes in Computer Science, pp.555-568, 2002.
DOI : 10.1007/3-540-45657-0_47

. Abdulla, Simulation-Based Iteration of Tree Transducers, 11th International Conference, TACAS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005 Proceedings, pp.30-44, 2005.
DOI : 10.1007/978-3-540-31980-1_3

A. Et-asavoae-]-asavoae, I. M. Et-asavoae, and M. , Collecting Semantics under Predicate Abstraction in the K Framework, Lecture Notes in Computer Science, vol.6381, pp.123-139, 2010.
DOI : 10.1007/978-3-642-16310-4_9

N. Baader, F. Baader, and T. Et-nipkow, Term Rewriting and All That, 1998.

. Bach, Model transformations with Tom, Proceedings of the Twelfth Workshop on Language Descriptions, Tools, and Applications, LDTA '12, p.16, 2012.
DOI : 10.1145/2427048.2427052
URL : https://hal.archives-ouvertes.fr/hal-00646350

. Bae, Abstract logical model checking of infinite-state systems using narrowing, RTA Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.81-96, 2013.

. Ball, . Rajamani, T. Ball, and S. K. Et-rajamani, Bebop: A Symbolic Model Checker for Boolean Programs, SPIN, pp.113-130, 2000.
DOI : 10.1007/10722468_7

. Ball, . Rajamani, T. Ball, and S. K. Et-rajamani, The SLAM Toolkit, CAV, pp.260-264, 2001.
DOI : 10.1007/3-540-44585-4_25

. Balland, 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

. Balland, Bytecode Rewriting in Tom, Electronic Notes in Theoretical Computer Science, vol.190, issue.1, pp.19-33, 2007.
DOI : 10.1016/j.entcs.2007.02.058
URL : https://hal.archives-ouvertes.fr/inria-00129513

. Barré, Copster homepage, 2009.

. Bauer, Quantitative Refinement for Weighted Modal Transition Systems, MFCS, 2011.
DOI : 10.1007/978-3-642-22993-0_9
URL : https://hal.archives-ouvertes.fr/hal-01088046

C. Bertot, Y. Bertot, and P. Et-castéran, Interactive theorem proving and program development. coq'art: The calculus of inductive constructions, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00344237

. Blanchet, Design and Implementation of a Special-Purpose Static Program Analyzer for Safety-Critical Real-Time Embedded Software, The Essence of Computation, pp.85-108, 2002.
DOI : 10.1007/3-540-36377-7_5
URL : https://hal.archives-ouvertes.fr/inria-00528442

. Boichut, Equational Abstraction Refinement for Certified Tree Regular Model Checking, ICFEM'12, 2012.
DOI : 10.1007/978-3-642-34281-3_22
URL : https://hal.archives-ouvertes.fr/hal-00759149

. Boichut, Finer Is Better: Abstraction Refinement for Rewriting Approximations, RTA, pp.48-62, 2008.
DOI : 10.1007/978-3-540-70590-1_4
URL : https://hal.archives-ouvertes.fr/hal-00563422

. Boichut, HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA, International Journal of Foundations of Computer Science, vol.20, issue.05, 2009.
DOI : 10.1142/S0129054109006917
URL : https://hal.archives-ouvertes.fr/hal-00561373

. Boichut, Rewriting Approximations for Fast Prototyping of Static Analyzers, 2006.
DOI : 10.1007/978-3-540-73449-9_6
URL : https://hal.archives-ouvertes.fr/hal-00463418

. Boichut, Rewriting Approximations for Fast Prototyping of Static Analyzers, RTA, LNCS 4533, pp.48-62, 2007.
DOI : 10.1007/978-3-540-73449-9_6
URL : https://hal.archives-ouvertes.fr/hal-00463418

. Boichut, . Héam, Y. Boichut, and P. Et-héam, A theoretical limit for safety verification techniques with regular fix-point computations, Information Processing Letters, vol.108, issue.1, pp.1-2, 2008.
DOI : 10.1016/j.ipl.2008.03.012
URL : https://hal.archives-ouvertes.fr/inria-00328487

. Boichut, Approximationbased tree regular model-checking, Nord. J. Comput, vol.14, issue.3, pp.216-241, 2008.

. Boigelot, Iterating transducers in the large (extended abstract), Computer Aided Verification, 15th International Conference, CAV 2003 Proceedings, volume 2725 of Lecture Notes in Computer Science, pp.223-235, 2003.

. Bouajjani, Abstract Regular Model Checking, Computer Aided Verification, 16th International Conference Proceedings, volume 3114 of Lecture Notes in Computer Science, pp.372-386, 2004.
DOI : 10.1007/978-3-540-27813-9_29
URL : https://hal.archives-ouvertes.fr/hal-00159512

. Bouajjani, Regular Model Checking, Computer Aided Verification, 12th International Conference Proceedings, volume 1855 of Lecture Notes in Computer Science, pp.403-418, 2000.
DOI : 10.1007/10722167_31
URL : https://hal.archives-ouvertes.fr/hal-00159512

. Bouajjani, . Touili, A. Bouajjani, and T. Et-touili, Extrapolating Tree Transformations, CAV, volume 2404 of LNCS, 2002.
DOI : 10.1007/3-540-45657-0_46
URL : https://hal.archives-ouvertes.fr/hal-00161115

. Bouhoula, Specification and proof in membership equational logic, Theoretical Computer Science, vol.236, issue.1-2, pp.35-132, 2000.
DOI : 10.1016/S0304-3975(99)00206-6
URL : https://hal.archives-ouvertes.fr/inria-00099079

. Boyer, . Genet, B. Boyer, and T. Genet, Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems, Proceedings Tenth International Workshop on Rule- Based Programming, pp.99-108, 2009.
DOI : 10.4204/EPTCS.21.9
URL : https://hal.archives-ouvertes.fr/hal-00780491

. Boyer, Certifying a Tree Automata Completion Checker, IJCAR, pp.523-538, 2008.
DOI : 10.1007/978-3-540-71070-7_43
URL : https://hal.archives-ouvertes.fr/inria-00258275

. Bruneton, Asm: A code manipulation tool to implement adaptable systems, Adaptable and extensible component systems, 2002.

. Bruni, . Meseguer, R. Bruni, and J. Et-meseguer, Generalized Rewrite Theories, Automata, Languages and Programming, 30th International Colloquium, ICALP 2003 Proceedings, volume 2719 of Lecture Notes in Computer Science, pp.252-266, 2003.
DOI : 10.1007/3-540-45061-0_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.8329

. Clavel, Maude: specification and programming in rewriting logic, Theoretical Computer Science, vol.285, issue.2, 2001.
DOI : 10.1016/S0304-3975(01)00359-0

. Clavel, Maude homepage, 2009.

. Clavel, All About Maude, A High-Performance Logical Framework, Lecture Notes in Computer Science, vol.4350, 2007.

C. Et-cousot-]-cousot, P. Et-cousot, and R. , Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, POPL, pp.238-252, 1977.

. Cuoq, Frama-C, SEFM, pp.233-247, 2012.
DOI : 10.1007/978-3-642-33826-7_16

. David, Efficient reasoning about data trees via integer linear programming, ICDT, pp.18-29, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00835833

. Durán, MTT: The Maude Termination Tool (System Description), Automated Reasoning, 4th International Joint Conference Proceedings, volume 5195 of Lecture Notes in Computer Science, pp.313-319, 2008.
DOI : 10.1007/978-3-540-71070-7_27

. Durán, . Meseguer, F. Durán, and J. Et-meseguer, A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications, Lecture Notes in Computer Science, vol.6381, pp.69-85, 2010.
DOI : 10.1007/978-3-642-16310-4_6

. Durán, . Meseguer, F. Durán, and J. Et-meseguer, A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories, Lecture Notes in Computer Science, vol.6381, pp.86-103, 2010.
DOI : 10.1007/978-3-642-16310-4_7

J. Engelfriet, Bottom-up and top-down tree transformations??? a comparison, Mathematical Systems Theory, vol.2, issue.2, pp.198-231, 1975.
DOI : 10.1007/BF01704020

. Ésik, . Liu, Z. Ésik, and G. Et-liu, Fuzzy tree automata, Fuzzy Sets and Systems, vol.158, issue.13, pp.1450-1460, 2007.
DOI : 10.1016/j.fss.2007.02.016

. Farzan, Formal Analysis of Java Programs in JavaFAN, CAV, pp.501-505, 2004.
DOI : 10.1007/978-3-540-27813-9_46

. Feuillade, Reachability Analysis over Term Rewriting Systems, Journal of Automated Reasoning, vol.37, issue.1?2, pp.3-4341, 2004.
DOI : 10.1007/s10817-004-6246-0
URL : https://hal.archives-ouvertes.fr/inria-00071609

F. Et-segoufin-]-figueira, D. Et-segoufin, and L. , Bottom-up automata on data trees and vertical xpath, STACS, 2011.

. Gallagher, J. Gallagher, and M. Et-rosendahl, Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation, LPAR'08, 2008.
DOI : 10.1007/978-3-540-89439-1_47

. Genest, Verifying recursive active documents with positive data tree rewriting, FSTTCS, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00461272

T. Genet, Decidable approximations of sets of descendants and sets of normal forms, RTA, volume 1379 of LNCS, 1998.
DOI : 10.1007/BFb0052368
URL : https://hal.archives-ouvertes.fr/inria-00073364

T. Genet, Timbuk 3.0 ? a Tree Automata Completion Tool. IRISA / Université de Rennes 1, 2008.
DOI : 10.1007/3-540-45653-8_48
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.269

T. Genet, Reachability analysis of rewriting for software verification, 2009.
URL : https://hal.archives-ouvertes.fr/tel-00477013

T. Genet, Towards Static Analysis of Functional Programs Using Tree Automata Completion, WRLA'14 : 10th International Workshop on Rewriting Logic and its Applications, 2014.
DOI : 10.1007/978-3-319-12904-4_8
URL : https://hal.archives-ouvertes.fr/hal-00921814

K. Genet, T. Genet, and F. Et-klay, Rewriting for Cryptographic Protocol Verification, cade, volume 1831 of lnai, 2000.
DOI : 10.1007/10721959_21
URL : https://hal.archives-ouvertes.fr/inria-00072731

R. Genet, T. Genet, and V. Et-rusu, Equational approximations for tree automata completion, Journal of Symbolic Computation, vol.45, issue.5, pp.574-597, 2010.
DOI : 10.1016/j.jsc.2010.01.009
URL : https://hal.archives-ouvertes.fr/inria-00495405

. Genet, . Viet-triem, . Tong, T. Genet, and V. Et-viet-triem-tong, Reachability Analysis of Term Rewriting Systems with Timbuk, pp.691-702, 2001.
DOI : 10.1007/3-540-45653-8_48
URL : https://hal.archives-ouvertes.fr/inria-00072321

. Genet, . Viet-triem, . Tong, T. Genet, and V. Et-viet-triem-tong, Timbuk ? a Tree Automata Library. IRISA / Université de Rennes 1, 2001.

. Henriksen, Mona: Monadic second-order logic in practice, TACAS '95, 1995.

. Henzinger, Software Verification with BLAST, SPIN, volume 2648 of Lecture Notes in Computer Science, pp.235-239, 2003.
DOI : 10.1007/3-540-44829-2_17

C. A. Hoare, An axiomatic basis for computer programming, Communications of the ACM, vol.12, issue.10, pp.576-580, 1969.
DOI : 10.1145/363235.363259

. Hubert, Sawja: Static Analysis Workshop for Java, Formal Verification of Object-Oriented Software -International Conference, pp.92-106, 2010.
DOI : 10.1023/B:JARS.0000021015.15794.82
URL : https://hal.archives-ouvertes.fr/inria-00504047

. Joshi, Tree adjunct grammars, Journal of Computer and System Sciences, vol.10, issue.1, pp.136-163, 1975.
DOI : 10.1016/S0022-0000(75)80019-5

C. Kaplan, S. Kaplan, and C. Et-choppy, Abstract rewriting with concrete operations, RTA, pp.178-186, 1989.

L. Kupferman, O. Kupferman, and Y. Et-lustig, Lattice Automata, VMCAI, 2007.
DOI : 10.1007/978-3-540-69738-1_14

[. Gall, J. Gall, T. Et-jeannet, and B. , Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification, SAS'07, pp.52-68, 2007.
DOI : 10.1007/978-3-540-74061-2_4

J. Leroux, Structural Presburger digit vector automata, Theoretical Computer Science, vol.409, issue.3, 2008.
DOI : 10.1016/j.tcs.2008.09.037
URL : https://hal.archives-ouvertes.fr/hal-00345971

. Leroy, The Objective Caml system release 3.00 ? Documentation and user's manual, 2000.

J. Lind-nielsen, Buddy 2.4, 2002.

. Meseguer, Equational Abstractions, Proc. 19th CADE Conf. volume 2741 of LNCS, pp.2-16, 2003.

. Otto, Automated termination analysis of java bytecode by term rewriting, RTA, LIPIcs. Dagstuhl, 2010.

L. C. Paulson, The isabelle reference manual, 2008.

D. Pichardie, Interprétation abstraite en logique intuitionniste : extraction d'analyseurs Java certifiés, 2005.

. Regehr, Testcase reduction for C compiler bugs, 33rd Conference on Programming Language Design and Implementation (PLDI'12), pp.335-346, 2012.

G. Ro¸suro¸su, K: a Rewrite-based Framework for Modular Language Design, Semantics, Analysis and Implementation, 2006.

G. Ro¸suro¸su and A. Et¸stef?et¸-et¸stef?-anescu, Matching Logic: A New Program Verification Approach (NIER Track), ICSE'11: Proceedings of the 30th International Conference on Software Engineering, pp.868-871, 2011.

. Rosu, Runtime Verification of C Memory Safety, Runtime Verification, pp.132-152, 2009.
DOI : 10.1145/248621.248623

R. Et-serbanuta-]-rosu, G. Et-serbanuta, and T. F. , K overview and simple case study, Proceedings of International K Workshop, 2013.

. Takai, Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability, RTA'11, 2000.
DOI : 10.1007/10721975_17