T. Vu-que-r-st-n,

. Si-r-n,

, Lemme 5, vol.1, p.16

, Soit t ? T (? ) un terme bien typé du type s. Alors t() = top et ?p ? Pos(t)\{}, t(p) = top

V. Le-mot, Cependant, d'autres techniques (dont certaines implémentées dans aprove) peuvent être utilisées

, Le mécanisme removeCycles permet de rendre le nombre de pairs critiques fini au prix d'une sur-approximation. Cette sur-approximation est parfois trop violente pour permettre l'analyse d'atteignabilité. Dans certains cas, il est possible de répartir l'ensemble des paires critiques dans deux ensembles disjoints :-un ensemble pouvant être infini et ne contenant que des paires critiques convergentes

, Dans ce cas, il n'est pas forcément nécessaire d'utiliser le mécanisme removeCycles

, Adapter les travaux que nous avons réalisés à cette classe plus large de langages semble intéressant. De manière plus générale, beaucoup de techniques utilisées pour améliorer ou contrôler la qualité des sur-approximations régulières semblent intéressantes et plus ou moins difficiles à mettre en place pour les techniques utilisant des langages synchronisés. Il parait notamment intéressant d'essayer de transposer le contrôle de la sur

, L'autre résultat présenté dans cette thèse est un algorithme de transformation de programmes logiques en cs-programmes à l'aide d'une sur-approximation

, 10] génère des clauses qui ne sont pas des cs-clauses. En utilisant la transformation de programmes logiques en cs-programmes dès que l'on génère un programme qui n'est pas un cs-programme, L'utilisation d'un système de réécriture non linéaire gauche dans la technique, vol.9

, Transformer en cs-programme le programme logique représentant l'intersection de deux cs-programmes permet de calculer une sur-approximation de cette intersection. Cela nous permet d'utiliser un cs-programme pour représenter l'ensemble des configurations indésirables. La sur-approximation induite par Generalization est souvent trop violente. La mise au point d'une autre règle d'inférence plus précise basée sur l'unification de langages permettrait d

J. Abrial, K. O. Matthew, D. Lee, P. N. Neilson, I. Scharbach et al., The b-method, VDM '91-Formal Software Development, 4th International Symposium of VDM Europe, vol.2, pp.398-405, 1991.

N. Andrianarivelo, V. Pelletier, and P. Réty, Transforming prefixconstrained or controlled rewrite systems, The 8th International Symposium on Symbolic Computation in Software Science, vol.45, pp.49-62, 2017.
DOI : 10.29007/m335

URL : https://hal.archives-ouvertes.fr/hal-01445668

, Term Rewriting and Applications, 18th International Conference, RTA 2007, vol.4533, 2007.

F. Baader and T. Nipkow, Term rewriting and all that, 1998.

E. Balland, Y. Boichut, T. Genet, and P. Moreau, Towards an efficient implementation of tree automata completion, Algebraic Methodology and Software Technology, 12th International Conference, vol.5140, pp.67-82, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00304010

E. Balland, P. Brauner, R. Kopetz, P. Moreau, and A. Reilles, Tom : Piggybacking rewriting on java, pp.36-47
DOI : 10.1007/978-3-540-73449-9_5

URL : https://hal.archives-ouvertes.fr/inria-00142045

E. Balland, P. Moreau, and A. Reilles, Effective strategic programming for java developers, Softw., Pract. Exper, vol.44, issue.2, pp.129-162, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01265319

Y. Boichut, B. Boyer, T. Genet, and A. Legay, Equational abstraction refinement for certified tree regular model checking, Formal Methods and Software Engineering-14th International Conference on Formal Engineering Methods, ICFEM 2012, vol.7635, pp.299-315, 2012.
DOI : 10.1007/978-3-642-34281-3_22

URL : https://hal.archives-ouvertes.fr/hal-00759149

Y. Boichut, J. Chabin, and P. Réty, Over-approximating descendants by synchronized tree languages, 24th International Conference on Rewriting Techniques and Applications, RTA 2013, vol.21, pp.128-142, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00808871

Y. Boichut, J. Chabin, and P. Réty, Erratum of over-approximating descendants by synchronized tree languages, 2015.

Y. Boichut, J. Chabin, and P. Réty, Towards more precise rewriting approximations, Language and Automata Theory and Applications-9th International Conference, vol.8977, pp.652-663, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01521746

Y. Boichut, R. Courbis, P. Héam, and O. Kouchnarenko, Finer is better : Abstraction refinement for rewriting approximations, Rewriting Techniques and Applications, 19th International Conference, RTA, vol.5117, pp.48-62, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00563422

Y. Boichut, T. Genet, T. P. Jensen, and L. Roux, Rewriting approximations for fast prototyping of static analyzers, pp.48-62
URL : https://hal.archives-ouvertes.fr/hal-00463418

Y. Boichut and P. Héam, A theoretical limit for safety verification techniques with regular fix-point computations, Inf. Process. Lett, vol.108, issue.1, pp.1-2, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00204579

Y. Boichut, V. Pelletier, and P. Réty, Synchronized tree languages for reachability in non-right-linear term rewrite systems, Rewriting Logic and Its Applications-11th International Workshop, WRLA 2016, vol.9942, pp.64-81, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01291393

A. Bouajjani, J. Esparza, and O. Maler, Reachability analysis of pushdown automata : Application to model-checking, CONCUR '97 : Concurrency Theory, 8th International Conference, vol.1243, pp.135-150, 1997.

N. Chomsky, On certain formal properties of grammars, Information and Control, vol.2, issue.2, pp.137-167, 1959.

H. Cirstea, S. Lenglet, and P. Moreau, A faithful encoding of programmable strategies into term rewriting systems, 26th International Conference on Rewriting Techniques and Applications, RTA 2015, vol.36, pp.74-88, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01168956

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-oliet et al., Maude : specification and programming in rewriting logic, Theor. Comput. Sci, vol.285, issue.2, pp.187-243, 2002.

H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard et al., Tree automata techniques and applications, 2007.

P. Cousot and R. Cousot, Abstract interpretation : A unified lattice model for static analysis of programs by construction or approximation of fixpoints, Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, pp.238-252, 1977.

N. Dershowitz, Termination of rewriting, J. Symb. Comput, vol.3, issue.1/2, pp.69-116, 1987.

J. Engelfriet, E. M. Schmidt, and O. I. Io, J. Comput. Syst. Sci, vol.15, issue.3, pp.328-353, 1977.

J. Engelfriet, E. M. Schmidt, and O. I. Io, J. Comput. Syst. Sci, vol.16, issue.1, pp.67-99, 1978.

T. Genet, Decidable approximations of sets of descendants and sets of normal forms, Rewriting Techniques and Applications, 9th International Conference, RTA-98, vol.1379, pp.151-165, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00098700

T. Genet and F. Klay, Rewriting for cryptographic protocol verification, 17th International Conference on Automated Deduction, vol.1831, pp.271-290, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00072731

T. Genet and V. Rusu, Equational approximations for tree automata completion, J. Symb. Comput, vol.45, issue.5, pp.574-597, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00495405

T. Genet and Y. Salmon, Reachability analysis of innermost rewriting, Logical Methods in Computer Science, vol.13, issue.1, 2017.
URL : https://hal.archives-ouvertes.fr/hal-00848260

J. Giesl and A. Middeldorp, Transformation techniques for context-sensitive rewrite systems, J. Funct. Program, vol.14, issue.4, pp.379-427, 2004.

J. Giesl, R. Thiemann, P. Schneider-kamp, and S. Falke, Automated termination proofs with aprove, pp.210-220

S. Gorn, Explicit definitions and linguistic dominoes, Systems and Computer Science, Proceedings of the Conference held at Univ. of Western Ontario, pp.77-115, 1965.

V. Gouranton, P. Réty, and H. Seidl, Synchronized tree languages revisited and new applications, Foundations of Software Science and Computation Structures, 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, vol.2030, pp.214-229, 2001.

I. Guessarian, Pushdown tree automata, Mathematical Systems Theory, vol.16, issue.4, pp.237-263, 1983.
URL : https://hal.archives-ouvertes.fr/hal-00020941

C. A. Hoare, An axiomatic basis for computer programming, Commun. ACM, vol.12, issue.10, pp.576-580, 1969.

F. Jacquemard, Y. Kojima, and M. Sakai, Term rewriting with prefix context constraints and bottom-up strategies, Automated Deduction-CADE-25-25th International Conference on Automated Deduction, vol.9195, pp.137-151, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01149319

J. Kochems and C. Ong, Improved functional flow and reachability analyses using indexed linear tree grammars, Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, RTA 2011, vol.10, pp.187-202, 2011.

M. Korp, C. Sternagel, H. Zankl, and A. Middeldorp, Tyrolean termination tool 2, Rewriting Techniques and Applications, 20th International Conference, vol.5595, pp.295-304, 2009.

, in Handbook of Theoretical Computer Science, Jan Leeuwen. Handbook of Theoretical Computer Science. Number, vol.1, 1990.

S. Limet and P. Réty, E-unification by means of tree tuple synchronized grammars, Discrete Mathematics & Theoretical Computer Science, vol.1, issue.1, pp.69-98, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00955691

S. Limet and P. Réty, E-unification by means of tree tuple synchronized grammars, TAPSOFT'97 : Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, vol.1214, pp.429-440, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00955691

S. Limet and G. Salzer, Proving properties of term rewrite systems via logic programs, pp.170-184

S. Limet and G. Salzer, Tree tuple languages from the logic programming point of view, J. Autom. Reasoning, vol.37, issue.4, pp.323-349, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00085310

S. Lucas, Context-sensitive computations in functional and functional logic programs, Journal of Functional and Logic Programming, issue.1, 1998.

P. Andrianarivelo and V. Pelletier, Transforming prefix-constrained or controlled rewrite systems, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01445668

A. Pettorossi and M. Proietti, Synthesis and transformation of logic programs using unfold/fold proofs, J. Log. Program, vol.41, issue.2-3, pp.197-230, 1999.

J. Réty and J. Chabin, R-unification thanks to synchronizedcontextfree languages, 19th Workshop on Unification (UNIF'2005), 2005.

J. Réty and J. Chabin, Synchronized contextfree tree-tuple languages, 2006.

. David-a-plaisted, A recursively defined ordering for proving termination of term rewriting systems, 1978.

A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science, pp.46-57, 1977.

J. C. Reynolds, Separation logic : A logic for shared mutable data structures, 17th IEEE Symposium on Logic in Computer Science (LICS 2002, pp.55-74, 2002.

C. William and . Rounds, Context-free grammars on trees, Proceedings of the 1st Annual ACM Symposium on Theory of Computing, pp.143-148, 1969.

Y. Salmon, Analyse d'atteignabilité pour les programmes fonctionnels avec stratégie d'évaluation en profondeur, Thomas Informatique Rennes, vol.1, 2015.

A. M. Turing, On computable numbers, with an application to the entscheidungsproblem. a correction, Proceedings of the London Mathematical Society, issue.1, pp.544-546, 1938.

, Rewriting Techniques and Applications, 15th International Conference, vol.3091, 2004.

J. Chabin, Y. Boichut, and P. Réty, Over-approximating descendants by synchronized tree languages, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00808871

J. Chabin, Y. Boichut, and P. Réty, Towards more precise rewriting approximations (full version), 2014.

V. Pelletier, Y. Boichut, and P. Réty, Synchronized tree languages for reachability in non-right-linear term rewrite systems (full version), 2015.

H. Zantema, Termination of term rewriting : Interpretation and type elimination, J. Symb. Comput, vol.17, issue.1, pp.23-50, 1994.