L. , etude des fonctions de rang linéaireslinéaires`linéairesà terme pour les boucles SLCentì eres est une extension naturellè a notre travaiì a envisager

E. Albert, P. Arenas, S. Genaim, M. Gómez-zamalloa, G. Puebla et al., Termination and cost analysis with COSTA and its user interfaces, Electr. Notes Theor. Comput. Sci, vol.258, issue.1, pp.109-121, 2009.

R. Bagnara and F. Mesnard, Andrea Pescetti, and Enea Zaffanella. A new look at the automatic synthesis of linear ranking functions, Information and Computation, vol.215, pp.47-67, 2012.

M. Amir, S. Ben-amram, and . Genaim, On the linear ranking problem for integer linearconstraint loops, 2012.

M. Amir, S. Ben-amram, and . Genaim, On the linear ranking problem for integer linearconstraint loops, POPL, pp.51-62

M. Amir, S. Ben-amram, A. Genaim, and . Masud, On the termination of integer loops, ACM Trans. Program. Lang. Syst, vol.34, issue.4, p.16, 2012.

M. Bozga, R. Iosif, and F. Konecn´ykonecn´y, Deciding conditional termination, Lecture Notes in Computer Science, vol.7214, pp.252-266, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01418906

A. R. Bradley, Z. Manna, and H. B. Sipma, The polyranking principle, Lecture Notes in Computer Science, pp.1349-1361, 2005.

A. R. Bradley, Z. Manna, and H. B. Sipma, Termination of polynomial programs, Lecture Notes in Computer Science, vol.3385, pp.113-129, 2005.

M. Braverman, Termination of integer linear programs, Lecture Notes in Computer Science, vol.4144, pp.372-385, 2006.

B. Cook, A. Podelski, and A. Rybalchenko, Termination proofs for systems code, pp.415-426, 2006.

A. C. Hearn, Reduce : The first forty years, Algorithmic Algebra and Logic, pp.19-24, 2005.

C. Holzbaur, OFAI clp(q,r) manual, edition 1.3.3, Austrian Research Institute for Artificial Intelligence, 1995.

A. Podelski and A. Rybalchenko, A complete method for the synthesis of linear ranking functions, Verification, Model Checking and Abstract Interpretation : Proceedings of the 5th International Conference, vol.2937, pp.239-251, 2004.

K. Sohn and A. Van-gelder, Termination detection in logic programs using argument sizes (extended abstract), Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp.216-226, 1991.

F. Spoto, F. Mesnard, and . Payet, A termination analyzer for java bytecode based on path-length, ACM Trans. Program. Lang. Syst, vol.32, issue.3, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01186167

A. Tiwari, Termination of linear programs, Lecture Notes in Computer Science, pp.70-82, 2004.