N. Beldiceanu, M. Carlsson, E. Poder, R. Sadek, and C. Truchet, A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects, Proc. of the 13th Int. Conf. on Principles and Practice of Constraint Programming, 2007.
DOI : 10.1007/978-3-540-74970-7_15
URL : https://hal.archives-ouvertes.fr/hal-00481558

F. Benhamou, Heterogeneous constraint solving, Proc. of the 5th Int. Conf. on Algebraic and Logic Programming, pp.62-76, 1996.
DOI : 10.1007/3-540-61735-3_4

F. Benhamou, F. Goualard, L. Granvilliers, and J. Puget, Revisiting hull and box consistency, Proc. of the 16th Int. Conf. on Logic Programming, pp.230-244, 1999.

N. Berger and L. Granvilliers, Some interval approximation techniques for MINLP, SARA, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00462786

J. Bertrane, P. Cousot, R. Cousot, J. Feret, L. Mauborgne et al., Static analysis and verification of aerospace software by abstract interpretation, AIAA Infotech@Aerospace 2010, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00528611

G. Chabert, L. Jaulin, and X. Lorca, A Constraint on the Number of Distinct Vectors with Application to Localization, CP, pp.196-210, 2009.
DOI : 10.1109/31.34669
URL : https://hal.archives-ouvertes.fr/hal-00428967

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/inria-00528590

P. Cousot and R. Cousot, Abstract Interpretation Frameworks, Journal of Logic and Computation, vol.2, issue.4, pp.511-547, 1992.
DOI : 10.1093/logcom/2.4.511

P. Cousot and N. Halbwachs, Automatic discovery of linear restraints among variables of a program, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '78, pp.84-96, 1978.
DOI : 10.1145/512760.512770

V. D. Silva, L. Haller, and D. Kroening, Satisfiability solvers are static analysers, Proc. of the 19th Int. Static Analysis Symposium (SAS'12), pp.317-333, 2012.

P. Granger, Improving the results of static analyses of programs by local decreasing iterations, Proc. of the 12th Conf. on Foundations of Software Technology and Theoretical Computer Science, 1992.
DOI : 10.1007/3-540-56287-7_95

N. Halbwachs and J. Henry, When the Decreasing Sequence Fails, Proc. of the 19th Int. Static Analysis Symposium (SAS'12), pp.198-213, 2012.
DOI : 10.1007/978-3-642-33125-1_15
URL : https://hal.archives-ouvertes.fr/hal-00734340

A. Hervieu, B. Baudry, and A. Gotlieb, PACOGEN: Automatic Generation of Pairwise Test Configurations from Feature Models, 2011 IEEE 22nd International Symposium on Software Reliability Engineering, pp.120-129, 2011.
DOI : 10.1109/ISSRE.2011.31
URL : https://hal.archives-ouvertes.fr/hal-00699558

L. Jaulin and S. Bazeille, Image Shape Extraction using Interval Methods, Proc. of the 15th IFAC Symposium on System Identification, 2009.
DOI : 10.3182/20090706-3-FR-2004.00062

B. Jeannet and A. Miné, Apron: A Library of Numerical Abstract Domains for Static Analysis, Proc. of the 21th Int. Conf. Computer Aided Verification, pp.661-667, 2009.
DOI : 10.1007/978-3-642-02658-4_52
URL : https://hal.archives-ouvertes.fr/hal-00786354

N. Lazaar, A. Gotlieb, and Y. Lebbah, A CP framework for testing CP, Constraints, vol.29, issue.4, pp.123-147, 2012.
DOI : 10.1007/s10601-012-9116-0

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

A. Miné, The octagon abstract domain. Higher-Order and Symbolic Computation, pp.31-100, 2006.

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, issue.2, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

M. Pelleau, C. Truchet, and F. Benhamou, Octagonal Domains for Continuous Constraints, Proc. of the 17th Int. Conf. on Principles and Practice of Constraint Programming, 2011.
DOI : 10.1007/978-3-642-23786-7_53
URL : https://hal.archives-ouvertes.fr/hal-00785598

C. Schulte and G. Tack, Implementing efficient propagation control, Proc. of the 3rd workshop on Techniques for Implementing Constraint Programming Systems, 2001.

C. Team, Choco: an open source Java constraint programming library, 2010.

A. Thakur and T. Reps, A generalization of støAlmarck's method, Proc. of the 19th Int. Static Analysis Symposium (SAS'12), pp.334-351, 2012.

C. Truchet, M. Pelleau, and F. Benhamou, Abstract Domains for Constraint Programming, with the Example of Octagons, 2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp.72-79, 2010.
DOI : 10.1109/SYNASC.2010.69
URL : https://hal.archives-ouvertes.fr/hal-01147921

P. Van-hentenryck, Y. Deville, and C. Teng, A generic arc-consistency algorithm and its specializations, Artificial Intelligence, vol.57, issue.2-3, 1992.
DOI : 10.1016/0004-3702(92)90020-X