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

C. Baier and J. Katoen, Principles of model checking, 2008.

M. S. Belaid, C. Michel, and M. Rueher, Boosting local consistency algorithms over floating-point numbers, Proc. of the 18th International Conference on Principles and Practice of Constraint Programming, vol.7514, pp.127-140, 2012.
DOI : 10.1007/978-3-642-33558-7_12

URL : https://hal.archives-ouvertes.fr/hal-01099514/document/

A. M. Ben-amram, Ranking functions for linear-constraint loops, Proc. of the 1st International Workshop on Verification and Program Transformation (VPT'13), vol.16, pp.1-8, 2013.
DOI : 10.29007/rvs4

URL : https://easychair.org/publications/download/kqj

A. M. Ben-amram and S. Genaim, Ranking functions for linear-constraint loops, Journal of the ACM, vol.61, issue.4, 2014.
DOI : 10.29007/rvs4

URL : https://easychair.org/publications/download/kqj

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.16, 2012.
DOI : 10.1007/978-3-642-27940-9_6

URL : http://www2.mta.ac.il/%7Eamirben/downloadable/toplas2012.pdf

M. Braverman, Termination of integer linear programs, Proc. of the 18th International Conference on Computer Aided Verification (CAV'06), vol.4144, pp.372-385, 2006.
DOI : 10.1007/11817963_34

URL : http://www.cs.toronto.edu/~mbraverm/CAV2006.pdf

H. Y. Chen, Program analysis: termination proofs for linear simple loops, 2012.
DOI : 10.1007/978-3-642-33125-1_28

H. Y. Chen, S. Flur, and S. Mukhopadhyay, Termination proofs for linear simple loops. Software Tools for Technology Transfer, vol.17, pp.47-57, 2015.
DOI : 10.1007/978-3-642-33125-1_28

B. Cook, D. Kroening, P. Rümmer, and C. M. Wintersteiger, Ranking function synthesis for bit-vector relations, Formal Methods in System Design, vol.43, issue.1, pp.93-120, 2013.
DOI : 10.1007/978-3-642-12002-2_19

URL : https://link.springer.com/content/pdf/10.1007%2F978-3-642-12002-2_19.pdf

P. Cousot and R. Cousot, Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints

M. A. Graham, R. Harrison, and . Sethi, Proc. of the 4th ACM Symposium on Principles of Programming Languages (POPL'77), pp.238-252, 1977.

C. David, D. Kroening, and M. Lewis, Unrestricted termination and nontermination arguments for bit-vector programs, Proc. of the 24th European Symposium on Programming (ESOP'15), vol.9032, pp.183-204, 2015.

P. Feautrier, Some efficient solutions to the affine scheduling problem. I. Onedimensional time, International Journal of Parallel Programming, vol.21, issue.5, pp.313-347, 1992.

L. Fousse, G. Hanrot, V. Lefèvre, P. Pélissier, and P. Zimmermann, MPFR: A multiple-precision binary floating-point library with correct rounding, ACM Transactions on Mathematical Software, vol.33, issue.2, p.13, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00070266

D. Goldberg, What every computer scientist should know about floating-point arithmetic, ACM Computing Surveys, vol.23, issue.1, pp.5-48, 1991.

C. Jeannerod and S. M. Rump, On relative errors of floating-point operations: optimal bounds and applications, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00934443

L. Khachiyan, Polynomial algorithms in linear programming, USSR Computational Mathematics and Mathematical Physics, vol.20, issue.1, pp.53-72, 1980.

F. Maurica, F. Mesnard, and E. Payet, Termination analysis of floating-point programs using parameterizable rational approximations, Proc. of the 31st ACM Symposium on Applied Computing (SAC'16), 2016.
URL : https://hal.archives-ouvertes.fr/hal-01451687

F. Mesnard and A. Serebrenik, Recurrence with affine level mappings is p-time decidable for CLP(R). Theory and Practice of Logic Programming, vol.8, pp.111-119, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01186188

A. Miné, Relational abstract domains for the detection of floating-point run-time errors, Computing Research Repository, 2007.

A. Podelski and A. Rybalchenko, A complete method for the synthesis of linear ranking functions, Proc. of the 5th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'04), vol.2937, pp.239-251, 2004.

A. Serebrenik and D. D. Schreye, Termination of floating-point computations, Journal of Automated Reasoning, vol.34, issue.2, pp.141-177, 2005.

M. Sipser, Introduction to the theory of computation, 1997.

A. Tiwari, Termination of linear programs, Proc. of the 16th International Conference on Computer Aided Verification (CAV'04), vol.3114, pp.70-82, 2004.