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

X. Allamigeon, S. Gaubert, and E. Goubault, Inferring min and max invariants using maxplus polyhedra, SAS, pp.189-204, 2008.
DOI : 10.1007/978-3-540-69166-2_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.5698

R. Bagnara, P. M. Hill, E. Mazzi, and E. Zaffanella, Widening Operators for Weakly-Relational Numeric Abstractions, SAS, LNCS, pp.3-18, 2005.
DOI : 10.1007/11547662_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.1267

B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne et al., A static analyzer for large safety-critical software, PLDI, pp.196-207, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00128135

L. Chen, A. Miné, J. Wang, and P. Cousot, Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships, SAS, pp.309-325, 2009.
DOI : 10.1007/0-387-32698-7_2
URL : https://hal.archives-ouvertes.fr/hal-00531564

L. Chen, A. Miné, J. Wang, and P. Cousot, An Abstract Domain to Discover Interval Linear Equalities, VMCAI, pp.112-128, 2010.
DOI : 10.1007/978-3-642-11319-2_11
URL : https://hal.archives-ouvertes.fr/hal-00531563

L. Chen, A. Miné, J. Wang, and P. Cousot, Linear Absolute Value Relation Analysis, ESOP, pp.156-175, 2011.
DOI : 10.1007/3-540-45013-0_7
URL : https://hal.archives-ouvertes.fr/hal-00648039

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

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

P. Cousot and R. Cousot, Systematic design of program analysis frameworks, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '79, pp.269-282, 1979.
DOI : 10.1145/567752.567778

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

D. L. Dill, Timing assumptions and verification of finite-state concurrent systems, Automatic Verification Methods for Finite State Systems, pp.197-212, 1989.
DOI : 10.1007/3-540-52148-8_17

G. Gange, J. A. Navas, P. Schachte, H. Søndergaard, and P. J. Stuckey, Abstract Interpretation over Non-lattice Abstract Domains, SAS, pp.6-24, 2013.
DOI : 10.1007/978-3-642-38856-9_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.369.4632

K. Ghorbal, F. Ivancic, G. Balakrishnan, N. Maeda, and A. Gupta, Donut Domains: Efficient Non-convex Domains for Abstract Interpretation, VMCAI, pp.235-250, 2012.
DOI : 10.1007/978-3-540-69738-1_20

P. Granger, Static analysis of arithmetical congruences, International Journal of Computer Mathematics, vol.30, issue.3-4, pp.165-199, 1989.
DOI : 10.1145/29873.29875

B. S. Gulavani and S. Gulwani, A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis, CAV, pp.370-384, 2008.
DOI : 10.1007/978-3-540-70545-1_35

A. Gurfinkel and S. Chaki, Boxes: A Symbolic Abstract Domain of Boxes, SAS, pp.287-303, 2010.
DOI : 10.1007/978-3-642-15769-1_18

J. M. Howe, A. King, C. Lawrence, and -. , Quadtrees as an Abstract Domain, Electronic Notes in Theoretical Computer Science, vol.267, issue.1, pp.89-100, 2010.
DOI : 10.1016/j.entcs.2010.09.008
URL : http://doi.org/10.1016/j.entcs.2010.09.008

B. Jeannet and A. Miné, Apron: A Library of Numerical Abstract Domains for Static Analysis, CAV, pp.661-667, 2009.
DOI : 10.1007/978-3-642-02658-4_52
URL : https://hal.archives-ouvertes.fr/hal-00786354

V. Laviron and F. Logozzo, SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities, VMCAI, 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.796-807, 2010.
DOI : 10.1145/1363686.1363736

A. Miné, The octagon abstract domain, Proc. of the Workshop on Analysis, Slicing, and Transformation (AST'01), pp.310-319, 2001.

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

M. Péron and N. Halbwachs, An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints, VMCAI, pp.268-282, 2007.
DOI : 10.1007/978-3-540-69738-1_20

S. Sankaranarayanan, H. Sipma, and Z. Manna, Scalable Analysis of Linear Systems Using Mathematical Programming, VMCAI, pp.25-41, 2005.
DOI : 10.1007/978-3-540-30579-8_2

A. Simon, A. King, and J. M. Howe, Two Variables per Linear Inequality as an Abstract Domain, LOPSTR, pp.71-89, 2003.
DOI : 10.1007/3-540-45013-0_7