M. Heizmann, N. D. Jones, and A. Podelski, Size-Change Termination and Transition Invariants, Proc. of SAS 2010
DOI : 10.1007/978-3-642-15769-1_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.8500

F. Maurica, F. Mesnard, and . Payet, On the Linear Ranking Problem for Simple Floating-Point Loops, Proc. of SAS 2016, pp.978-981
DOI : 10.1007/978-3-540-27813-9_6
URL : https://hal.archives-ouvertes.fr/hal-01451688

D. Goldberg, What every computer scientist should know about floatingpoint arithmetic, ACM Computing Surveys, vol.23, issue.1, 1991.
DOI : 10.1145/103162.103163
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.7712

J. Muller, On the definition of ulp(x), INRIA, Tech. Rep, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00070503

L. Khachiyan, Polynomial algorithms in linear programming, USSR Computational Mathematics and Mathematical Physics, 1980.
DOI : 10.1016/0041-5553(80)90061-0

L. Fousse, G. Hanrot, V. Lefèvre, P. Pélissier, and P. Zimmermann, MPFR, ACM Transactions on Mathematical Software, vol.33, issue.2, 2007.
DOI : 10.1145/1236463.1236468
URL : https://hal.archives-ouvertes.fr/inria-00070266

M. S. Belaid, C. Michel, and M. Rueher, Boosting Local Consistency Algorithms over Floating-Point Numbers, Proc. of CP 2012. Available, pp.978-981
DOI : 10.1007/978-3-642-33558-7_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.667.3050

S. Boldo and T. M. Nguyen, Proofs of numerical programs when the compiler optimizes, Innovations in Systems and Software Engineering, vol.1, issue.3, pp.11334-11345, 2011.
DOI : 10.1112/S1461157000000176
URL : https://hal.archives-ouvertes.fr/hal-00777639

A. Miné, Relational abstract domains for the detection of floatingpoint run-time errors, Proc. of ESOP, 2004.

C. Jeannerod and S. M. Rump, On relative errors of floatingpoint operations: optimal bounds and applications, Tech. Rep, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00934443

P. Cousot and R. Cousot, A gentle introduction to formal verification of computer systems by abstract interpretation, Logics and Languages for Reliability and Security, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00543886

D. Delmas, E. Goubault, S. Putot, J. Souyris, K. Tekkal et al., Towards an Industrial Use of FLUCTUAT on Safety-Critical Avionics Software, Proc. of FMICS 2009
DOI : 10.1007/978-3-642-04570-7_6

F. Maurica, F. Mesnard, and . Payet, Termination analysis of floating-point programs using parameterizable rational approximations, Proceedings of the 31st Annual ACM Symposium on Applied Computing, SAC '16
DOI : 10.1007/978-3-540-24622-0_20
URL : https://hal.archives-ouvertes.fr/hal-01451687

V. Lefèvre, A. Tisserand, and J. Muller, Towards correctly rounded transcendentals, Proc. of ARITH, p.614888, 1997.

A. Serebrenik and D. D. Schreye, Termination of Floating-Point Computations, Journal of Automated Reasoning, vol.13, issue.2/3, 2005.
DOI : 10.1007/3-540-63165-8_236

C. David, D. Kroening, and M. Lewis, Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs, Proc. of ESOP 2015
DOI : 10.1007/978-3-662-46669-8_8
URL : http://arxiv.org/abs/1410.5089

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.10703-10716, 2013.
DOI : 10.1007/978-3-642-12002-2_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.4737

M. Codish, V. Lagoon, and P. J. Stuckey, Testing for Termination with Monotonicity Constraints, Proc. of ICLP 2005, p.25, 11562931.
DOI : 10.1007/11562931_25