A. Adjé, S. Gaubert, and E. Goubault, Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis, PLS'10, pp.23-42, 2010.

K. R. Apt, The essence of constraint propagation, Theoretical Computer Science, vol.221, issue.1-2, 1999.
DOI : 10.1016/S0304-3975(99)00032-8

F. Benhamou, F. Goualard, L. Granvilliers, and J. Puget, Revisiting hull and box consistency, ICLP'99, pp.230-244, 1999.

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, pp.2010-3385, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00528611

A. Bradley, SAT-Based Model Checking without Unrolling, VMCAI'11, pp.70-87, 2011.
DOI : 10.1007/3-540-40922-X_8

E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, Counterexample-guided abstraction refinement, CAV'00, pp.154-169, 2000.

M. Colón, S. Sankaranarayanan, and H. Sipma, Linear Invariant Generation Using Non-linear Constraint Solving, CAV'03, pp.420-432, 2003.
DOI : 10.1007/978-3-540-45069-6_39

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977.
DOI : 10.1145/512950.512973

URL : https://hal.archives-ouvertes.fr/hal-01108790

S. Das, D. Dill, and S. Park, Experience with Predicate Abstraction, CAV'99, pp.160-171, 1999.
DOI : 10.1007/3-540-48683-6_16

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

V. D. Silva, L. Haller, and D. Kroening, Satisfiability solvers are static analysers, SAS'12, pp.317-333, 2012.

V. D. Silva, L. Haller, D. Kroening, and M. Tautschnig, Numeric bounds analysis with conflict-driven learning, TACAS'12, pp.48-63, 2012.

J. Feret, Static Analysis of Digital Filters, LNCS, vol.2986, pp.33-48, 2004.
DOI : 10.1007/978-3-540-24725-8_4

URL : https://hal.archives-ouvertes.fr/inria-00528447

P. Garg, C. Löding, P. Madhusudan, and D. Neider, ICE:??A??Robust??Framework??for??Learning??Invariants, CAV'14, pp.69-87, 2014.
DOI : 10.1007/978-3-319-08867-9_5

P. Garoche, T. Kahsai, and C. Tinelli, Incremental Invariant Generation Using Logic-Based Automatic Abstract Transformers, NFM'13, 2013.
DOI : 10.1007/978-3-642-38088-4_10

P. Granger, Improving the results of static analyses of programs by local decreasing iterations, FSTTCS'92, 1992.
DOI : 10.1007/3-540-56287-7_95

S. Gulwani, S. Srivastava, and R. Venkatesan, Program analysis as constraint solving, PLDI'08, pp.281-292, 2008.

S. Itzhaky, N. Bjørner, T. Reps, M. Sagiv, and A. Thakur, Property-Directed Shape Analysis, CAV'14, pp.35-51, 2014.
DOI : 10.1007/978-3-319-08867-9_3

B. Jeannet and A. Miné, Apron: A Library of Numerical Abstract Domains for Static Analysis, CAV'09, pp.661-667, 2009.
DOI : 10.1007/978-3-642-02658-4_52

URL : https://hal.archives-ouvertes.fr/hal-00786354

A. Miné, Relational Abstract Domains for the Detection of Floating-Point Run-Time Errors, ESOP'04, pp.3-17, 2004.
DOI : 10.1007/978-3-540-24725-8_2

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

A. Miné, J. Breck, and T. Reps, An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs, CS Dept., Univ. of Wisconsin, vol.311, issue.2, 2016.
DOI : 10.1007/11513988_13

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

R. E. Moore, Interval Analysis, 1966.

M. Pelleau, A. Miné, C. Truchet, and F. Benhamou, A Constraint Solver Based on Abstract Domains, VMCAI'13, p.17, 2013.
DOI : 10.1007/978-3-642-35873-9_26

URL : https://hal.archives-ouvertes.fr/hal-00785604

O. Ponsini, C. Michel, and M. Rueher, Combining Constraint Programming and Abstract Interpretation for Value Analysis of Floating-point Programs, 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation, pp.775-776, 2012.
DOI : 10.1109/ICST.2012.175

P. Roux and P. Garoche, Practical policy iterations, Formal Methods in System Design, vol.38, issue.1, pp.163-196, 2015.
DOI : 10.1007/s10703-015-0230-7

H. Sa¨?disa¨?di and N. Shankar, Abstract and model check while you prove, CAV'99, pp.443-454, 1999.

S. Sankaranarayanan, H. Sipma, and Z. Manna, Constraint-Based Linear-Relations Analysis, SAS'04, pp.53-68, 2004.
DOI : 10.1007/978-3-540-27864-1_7

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-310, 1955.
DOI : 10.2140/pjm.1955.5.285

A. Thakur, A. Lal, J. Lim, and T. Reps, PostHat and All That: Automating Abstract Interpretation, Electronic Notes in Theoretical Computer Science, vol.311, pp.15-32, 2015.
DOI : 10.1016/j.entcs.2015.02.003

A. Thakur and T. Reps, A Generalization of St??lmarck???s Method, SAS'12, pp.334-351, 2012.
DOI : 10.1007/978-3-642-33125-1_23

Y. Xie and A. Aiken, Saturn: A SAT-Based Tool for Bug Detection, CAV'05, pp.139-143, 2005.
DOI : 10.1007/11513988_13