R. Bagnara, P. M. Hill, and E. Zaffanella, Weakly-relational shapes for numeric abstractions: improved algorithms and proofs of correctness, Formal Methods in System Design, vol.27, issue.2, pp.279-323, 2009.
DOI : 10.1007/s10703-009-0073-1

M. Bouaziz, TreeKs: A Functor to Make Numerical Abstract Domains Scalable, Electronic Notes in Theoretical Computer Science, vol.287, pp.41-52, 2012.
DOI : 10.1016/j.entcs.2012.09.005

A. Chawdhary, E. Robbins, and A. King, Simple and Efficient Algorithms for Octagons, LNCS, vol.8858, pp.296-313, 2014.
DOI : 10.1007/978-3-319-12736-1_16

L. Chen, J. Liu, A. Miné, D. Kapur, and J. Wang, An Abstract Domain to Infer Octagonal Constraints with Absolute Value, LNCS, vol.8723, pp.101-117, 2014.
DOI : 10.1007/978-3-319-10936-7_7
URL : https://hal.archives-ouvertes.fr/hal-01105217

R. Clarisó and J. Cortadella, The octahedron abstract domain, LNCS, vol.3148, pp.312-327, 2004.

P. Cousot and R. Cousot, Static determination of dynamic properties of programs, Proceedings of the Second International Symposium on Programming, pp.106-130, 1976.

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, and A. , Why does Astr??e scale up?, Formal Methods in System Design, vol.345, issue.1, pp.229-264, 2009.
DOI : 10.1007/s10703-009-0089-6

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

J. Jourdan, V. Laporte, S. Blazy, X. Leroy, and D. Pichardie, A formally-verified C static analyzer, pp.247-259, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01078386

J. Jourdan, Verasco: a Formally Verified C Static Analyzer, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01327023

V. Laviron and F. Logozzo, SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities, LNCS, vol.5403, pp.229-244, 2009.
DOI : 10.1007/978-3-540-93900-9_20

F. Logozzo and M. Fähndrich, Pentagons, Proceedings of the 2008 ACM symposium on Applied computing , SAC '08, pp.184-188, 2008.
DOI : 10.1145/1363686.1363736

A. Miné, Weakly relational numerical abstract domains, 2004.

A. Miné, The octagon abstract domain, HOSC, vol.19, pp.31-100, 2006.

S. Putot and E. Goubault, Static analysis of numerical algorithms, LNCS, vol.4134, pp.18-34, 2006.

A. Simon and A. King, The two variable per inequality abstract domain, Higher-Order and Symbolic Computation, vol.1, issue.1, pp.87-143, 2010.
DOI : 10.1007/s10990-010-9062-8

G. Singh, M. Püschel, and M. Vechev, Making numerical program analysis fast, pp.303-313, 2015.
DOI : 10.1145/2813885.2738000