R. Bagnara and F. Mesnard, Eventual linear ranking functions, Principles and Practice of Declarative Programming, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01451694

M. S. Belaid, C. Michel, and M. Rueher, Boosting local consistency algorithms over floating-point numbers, Principles and Practice of Constraint Programming, 2012.

S. Boldo, J. Filliâtre, and G. Melquiond, Combining Coq and Gappa for certifying floating-point programs, Intelligent Computer Mathematics, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00432726

S. Boldo and T. M. Nguyen, Hardware-independent proofs of numerical programs, NASA Formal Methods, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00534410

S. Boldo and T. M. Nguyen, Proofs of numerical programs when the compiler optimizes, Innovations in Systems and Software Engineering, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00777639

A. R. Bradley, Z. Manna, and H. B. Sipma, The polyranking principle, Automata, Languages and Programming, 2005.

H. Y. Chen, S. Flur, and S. Mukhopadhyay, Termination proofs for linear simple loops, Static Analysis, 2012.

C. David, D. Kroening, and M. Lewis, Unrestricted termination and non-termination arguments for bit-vector programs, European Symposium on Programming, 2015.
DOI : 10.1007/978-3-662-46669-8_8
URL : http://arxiv.org/pdf/1410.5089

D. Delmas, E. Goubault, S. Putot, J. Souyris, K. Tekkal et al., Towards an industrial use of Fluctuat on safety-critical avionics software, Formal Methods for Industrial Critical Systems, 2009.
DOI : 10.1007/978-3-642-04570-7_6
URL : http://www.lix.polytechnique.fr/Labo/Sylvie.Putot/Publications/fmics09.pdf

D. Goldberg, What every computer scientist should know about floating-point arithmetic, 1991.
DOI : 10.1145/103162.103163

N. J. Higham, Accuracy and Stability of Numerical Algorithms, Society for Industrial and Applied Mathematics, 2002.

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

G. P. Mccormick, Computability of global solutions to factorable nonconvex programs: Part I-Convex underestimating problems, Mathematical Programming, 1976.

A. Miné, Relational abstract domains for the detection of floating-point run-time errors, European Symposium on Programming, 2004.

A. Podelski and A. Rybalchenko, A complete method for the synthesis of linear ranking functions, Verification, model checking, and abstract interpretation, 2004.

A. Serebrenik and D. De-schreye, Termination of floating-point computations, Journal of Automated Reasoning, 2005.
DOI : 10.1007/s10817-005-6546-z
URL : http://www.cs.kuleuven.be/~dtai/publications/files/41544.pdf