F. A. and J. E. Falk, Jointly constrained biconvex programming, Mathematics of Operations Research, vol.8, issue.2, p.273286, 1983.

A. Armando, J. Mantovani, and L. Platania, Bounded model checking of software using smt solvers instead of sat solvers, Int. J. Softw. Tools Technol. Transf, vol.11, p.6983, 2009.

A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, Symbolic Model Checking without BDDs, Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems, TACAS '99, 1999.
DOI : 10.1007/3-540-49059-0_14

G. Borradaile and P. Van-hentenryck, Safe and tight linear estimators for global optimization, Mathematical Programming, 2005.
DOI : 10.1007/s10107-004-0533-8

B. Botella, A. Gotlieb, and C. Michel, Symbolic execution of oating-point computations, Softw. Test., Verif. Reliab, vol.16, issue.2, p.97121, 2006.

A. Brillout, D. Kroening, and T. Wahl, Mixed abstractions for oating-point arithmetic, Proceedings of FMCAD 2009, p.6976, 2009.

L. Chen, A. Miné, and P. Cousot, A sound oating-point polyhedra abstract domain, Proceedings of the 6th Asian Symposium on Programming Languages and Systems, APLAS '08, p.318, 2008.

H. Collavizza, M. Rueher, and P. Hentenryck, CPBPV: a constraint-programming framework for bounded program verification, Constraints, vol.404, issue.3, pp.238-264, 2010.
DOI : 10.1007/s10601-009-9089-9
URL : https://hal.archives-ouvertes.fr/hal-01099509

L. Cordeiro, B. Fischer, and J. Marques-silva, Smt-based bounded model checking for embedded ansi-c software, IEEE Transactions on Software Engineering, 2011.

P. Cousot, R. Cousot, J. Feret, A. Miné, L. Mauborgne et al., Varieties of Static Analyzers: A Comparison with ASTREE, First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07), p.320, 2007.
DOI : 10.1109/TASE.2007.55
URL : https://hal.archives-ouvertes.fr/hal-00154031

K. Malay, A. Ganai, and . Gupta, Accelerating high-level bounded model checking, Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design, ICCAD '06, p.794801, 2006.

K. Ghorbal, E. Goubault, and S. Putot, A Logical Product Approach to Zonotope Intersection, Computer Aided Verication, p.212226, 2010.
DOI : 10.1007/978-3-642-14295-6_22

A. Gotlieb, B. Botella, and M. Rueher, Automatic test data generation using constraint solving techniques, ISSTA, p.5362, 1998.

A. Gotlieb, B. Botella, and M. Rueher, A CLP Framework for Computing Structural Test Data, Computational Logic, volume 1861 of Lecture Notes in Computer Science, p.399413, 2000.
DOI : 10.1007/3-540-44957-4_27

Y. Lebbah, C. Michel, M. Rueher, D. Daney, and J. Merlet, Ecient and safe global constraints for handling numerical constraint systems

O. Lhomme, Consistency techniques for numeric csps, IJCAI, pp.232-238, 1993.

B. Marre and C. Michel, Improving the oating point addition and subtraction constraints, Lecture Notes in Computer Science, vol.6308, p.360367, 2010.

G. P. Mccormick, Computability of global solutions to factorable nonconvex programs: Part I ??? Convex underestimating problems, Mathematical Programming, p.147175, 1976.
DOI : 10.1287/mnsc.17.11.759

C. Michel, Y. Lebbah, and M. Rueher, Safe embedding of the simplex algorithm in a CSP framework, Proc. of CPAIOR 2003, p.210220, 2003.

C. Michel, Exact projection functions for oating point number constraints, AMAI, 2002.

C. Michel, M. Rueher, and Y. Lebbah, Solving constraints over oating-point numbers, Lecture Notes in Computer Science, vol.2239, p.524538, 2001.

A. Miné, Weakly Relational Numerical Abstract Domains, 2004.

A. Neumaier and O. Shcherbina, Safe bounds in linear and mixed-integer linear programming, Mathematical Programming, vol.99, issue.2, pp.99283-296, 2004.
DOI : 10.1007/s10107-003-0433-3

S. Hong, N. V. Ryoo, and . Sahinidis, A branch-and-reduce approach to global optimization, Journal of Global Optimization, p.107138, 1996.