E. Albert, P. Arenas, S. Genaim, M. Gómez-zamalloa, G. Puebla et al., Termination and cost analysis with COSTA and its user interfaces, Electronic Notes in Theoretical Computer Science, vol.258, issue.1, pp.109-121, 2009.

A. Alezan, R. Bagnara, F. Mesnard, and E. Payet, Détection des fonctions de rang linéaireslinéaires`linéairesà terme, Actes des Neuvi?AímesNeuvi? Neuvi?ANeuvi?Aímes Jourñ Al'es Francophones de Programmation par Contraintes (JFPC 2013), pp.11-20, 2013.

R. Bagnara, M. Carlier, R. Gori, and A. Gotlieb, Symbolic path-oriented test data generation for floating-point programs, Proceedings of the 6th IEEE International Conference on Software Testing, Verification and Validation, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00807884

R. Bagnara, P. M. Hill, and E. Zaffanella, The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems, Science of Computer Programming, vol.72, issue.1-2, pp.3-21, 2008.

R. Bagnara, F. Mesnard, A. Pescetti, and E. Zaffanella, The automatic synthesis of linear ranking functions: The complete unabridged version, 2012.

R. Bagnara, F. Mesnard, A. Pescetti, and E. Zaffanella, A new look at the automatic synthesis of linear ranking functions, Information and Computation, vol.215, pp.47-67, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01186145

P. Baudin, P. Cuoq, J. Filliâtre, C. Marché, B. Monate et al., ACSL: ANSI/ISO C Specification Language, CEA LIST and INRIA, vol.1, 2013.

M. S. Belaid, C. Michel, and M. Rueher, Boosting local consistency algorithms over floating-point numbers, Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming, vol.7514, pp.127-140, 2012.

A. M. Ben-amram and S. Genaim, On the linear ranking problem for integer linear-constraint loops, 2013.

A. M. Ben-amram and S. Genaim, On the linear ranking problem for integer linear-constraint loops, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '13), pp.51-62, 2013.

A. M. Ben-amram, S. Genaim, and A. N. Masud, On the termination of integer loops, ACM Transactions on Programming Languages and Systems, vol.34, issue.4, p.24, 2012.

M. Bozga, R. Iosif, and F. Konecn´ykonecn´y, Deciding conditional termination, Tools and Algorithms for the Construction and Analysis of Systems: Proceedings of the 18th International Conference (TACAS 2012, vol.7214, pp.252-266, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01418906

A. R. Bradley, Z. Manna, H. B. Sipma, ;. Caires, G. F. Italiano et al., The polyranking principle, Automata, Languages and Programming: Proceedings of the 32nd International Colloquium (ICALP 2005), vol.3580, pp.1349-1361, 2005.

A. R. Bradley, Z. Manna, and H. B. Sipma, Termination of polynomial programs, Model Checking and Abstract Interpretation: Proceedings of the 6th International Conference (VMCAI 2005, vol.3385, pp.113-129, 2005.

M. Braverman, Termination of integer linear programs, Computer Aided Verification: Proceedings of the 18th International Conference (CAV 2006), vol.4144, pp.372-385, 2006.

B. Cook, A. Podelski, and A. Rybalchenko, Termination proofs for systems code, Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation, pp.415-426, 2006.

P. Ganty and S. Genaim, Proving termination starting from the end, 2013.

P. Ganty and S. Genaim, Proving termination starting from the end, Computer Aided Verification: Proceedings of the 25th International Conference (CAV 2013, vol.8044, pp.397-412, 2013.

A. C. Hearn, REDUCE: the first forty years, Algorithmic Algebra and Logic: Proceedings of the A3L 2005 Conference in Honor of the 60th Birthday of Volker Weispfenning, pp.19-24, 2005.

C. Holzbaur, Austrian Research Institute for Artificial Intelligence, 1995.

C. Otto, M. Brockschmidt, C. Von-essen, and J. Giesl, Automated termination analysis of Java bytecode by term rewriting, Proceedings of the 21st International Conference on Rewriting Techniques and Applications, vol.6, pp.259-276, 2010.

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.
DOI : 10.1145/113413.113433

F. Spoto, F. Mesnard, and . Payet, A termination analyzer for Java bytecode based on path-length, ACM Transactions on Programming Languages and Systems, vol.32, issue.3, 2010.
DOI : 10.1145/1709093.1709095
URL : https://hal.archives-ouvertes.fr/hal-01186167

A. Tiwari, Termination of linear programs, Computer Aided Verification: Proceedings of the 16th International Conference (CAV 2004), vol.3114, pp.70-82, 2004.
DOI : 10.1007/978-3-540-27813-9_6
URL : http://www.csl.sri.com/users/tiwari/cav04.pdf

C. Urban, The abstract domain of segmented ranking functions, Proceedings of the 20th International Symposium on Static Analysis (SAS 2013), vol.7935, pp.43-62, 2013.
DOI : 10.1007/978-3-642-38856-9_5
URL : https://hal.archives-ouvertes.fr/hal-00925670

H. Y. Chen, S. Flur, and S. Mukhopadhyay, Termination proofs for linear simple loops, Proceedings of the 19th International Symposium on Static Analysis, vol.7460, pp.422-438, 2012.
DOI : 10.1007/978-3-642-33125-1_28