R. Bagnara, E. Ricci, E. Zaffanella, and P. M. Hill, Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library, Static Analysis : Proceedings of the 9th International Symposium, pp.213-229, 2002.
DOI : 10.1007/3-540-45789-5_17

R. Bagnara, K. Dobson, P. M. Hill, M. Mundell, and E. Zafanella, Grids: A Domain for Analyzing the Distribution of Numerical Values, LOPSTR, 2006.
DOI : 10.1007/978-3-540-71410-1_16

G. Balakrishnan and T. W. Reps, Analyzing Memory Accesses in x86 Executables, LNCS, vol.2985, pp.5-23, 2004.
DOI : 10.1007/978-3-540-24723-4_2

E. Baralis and J. Widom, An algebraic approach to static analysis of active database rules, ACM Transactions on Database Systems, vol.25, issue.3, pp.269-332, 2000.
DOI : 10.1145/363951.363954

C. Héì-ene and M. Rueher, Exploration of the capabilities of constraint programming for software verification, TACAS, pp.182-196, 2006.

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., The ASTRE?? Analyzer, ESOP'05, 2005.
DOI : 10.1007/978-3-540-31987-0_3

R. Davis, B. G. Buchanan, and E. H. Shortliffe, Production rules as a representation for a knowledge-based consultation program???, Artificial Intelligence, vol.8, issue.1, pp.15-45, 1977.
DOI : 10.1016/0004-3702(77)90003-0

C. Forgy, Rete: A fast algorithm for the many pattern/many object pattern match problem, Artificial Intelligence, vol.19, issue.1, pp.17-37, 1982.
DOI : 10.1016/0004-3702(82)90020-0

P. Granger, Static analysis of arithmetic congruences, International Journal of Computer Math, pp.165-199, 1989.

P. Granger, Static analysis of linear congruence equalities among variables of a program, TAPSOFT, pp.169-192, 1991.
DOI : 10.1007/3-540-53982-4_10

P. Granger, Static analyses of congruence properties on rational numbers (extended abstract), LNCS, vol.1302, pp.278-292, 1997.
DOI : 10.1007/BFb0032748

D. Stephen and . Hendrick, Business Rule Management Systems : Addressing Referential Rule Integrity, www.ilog.com. [17] ILOG. ILOG JRules, 2000.

E. Donald and . Knuth, Seminumerical Algorithms, The Art of Computer Programming, vol.2

J. Ere, A language and a program for stating and solving combinatorial problems, Artif. Intell, vol.10, issue.1, pp.29-127, 1978.

L. I. Jean-louislaurì-ere, Programmation de contraintes ou programmation automatique, 1996.

O. Lhomme, A. Gotlieb, and M. Rueher, Dynamic optimization of interval narrowing algorithms, The Journal of Logic Programming, vol.37, issue.1-3, pp.165-183, 1998.
DOI : 10.1016/S0743-1066(98)10007-9
URL : https://hal.archives-ouvertes.fr/inria-00540302

A. Miné, A Few Graph-Based Relational Numerical Abstract Domains, SAS, pp.117-132, 2002.
DOI : 10.1007/3-540-45789-5_11

M. Müller-olm and H. Seidl, A Generic Framework for Interprocedural Analysis of Numerical Properties, SAS, pp.235-250, 2005.
DOI : 10.1007/11547662_17

A. Podelski and A. Rybalchenko, A Complete Method for the Synthesis of Linear Ranking Functions, LNCS, vol.2937, pp.239-251, 2004.
DOI : 10.1007/978-3-540-24622-0_20

D. Toman, J. Chomicki, and D. S. Rogers, Datalog with integer periodicity constraints, SLP, pp.189-203, 1994.
DOI : 10.1016/S0743-1066(97)10008-5
URL : http://doi.org/10.1016/s0743-1066(97)10008-5

M. Venable, M. R. Chouchane, M. Karim, and A. Lakhotia, Analyzing Memory Accesses in Obfuscated x86 Executables, LNCS, vol.3548, pp.1-18, 2005.
DOI : 10.1007/11506881_1