J. Abrial, The B-Book: Assigning Programs to Meanings, 2005.
DOI : 10.1017/CBO9780511624162

R. Bagnara, P. M. Hill, E. Ricci, and E. Zaffanella, Precise widening operators for convex polyhedra, Science of Computer Programming, vol.58, issue.1-2, pp.28-56, 2005.
DOI : 10.1016/j.scico.2005.02.003

R. Bagnara, P. M. Hill, and E. Zaffanella, The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems, Science of Computer Programming, vol.72, issue.1-2, pp.3-21, 2008.
DOI : 10.1016/j.scico.2007.08.001

C. Barrett, A. Stump, and C. Tinelli, The SMT-LIB Standard: Version 2.0, SMT, 2010.

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

F. Bourdoncle, Sémantiques des Langages Impératifs d'Ordre Supérieur et Interprétation Abstraite, 1992.

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., The ASTRÉEASTR´ASTRÉE analyzer, Programming Languages and Systems (ESOP), number 3444 in LNCS, pp.21-30, 2005.

L. M. De-moura and N. Bjørner, Z3: An Efficient SMT Solver, TACAS, pp.337-340, 2008.
DOI : 10.1007/978-3-540-78800-3_24

B. Dutertre and L. M. De-moura, A Fast Linear-Arithmetic Solver for DPLL(T), CAV, pp.81-94, 2006.
DOI : 10.1007/11817963_11

D. Gopan and T. W. Reps, Guided Static Analysis, SAS, pp.349-365, 2007.
DOI : 10.1007/978-3-540-74061-2_22

J. Henry, D. Monniaux, and M. Moy, Succinct Representations for Abstract Interpretation, Static analysis (SAS), Lecture Notes in Computer Science, 2012.
DOI : 10.1007/978-3-642-33125-1_20
URL : https://hal.archives-ouvertes.fr/hal-00709833

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

C. Lattner and V. Adve, LLVM: A compilation framework for lifelong program analysis & transformation, International Symposium on Code Generation and Optimization, 2004. CGO 2004., pp.75-86, 2004.
DOI : 10.1109/CGO.2004.1281665

A. Miné, Symbolic Methods to Enhance the Precision of Numerical Abstract Domains, VMCAI, pp.348-363, 2006.
DOI : 10.1007/11609773_23

D. Monniaux and L. Gonnord, Using Bounded Model Checking to Focus Fixpoint Iterations, Static analysis (SAS), pp.369-385, 2011.
DOI : 10.1007/11823230_2
URL : https://hal.archives-ouvertes.fr/hal-00600087

D. Monniaux and J. Le-guen, Stratified Static Analysis Based on Variable Dependencies, Electronic Notes in Theoretical Computer Science, vol.288, 2011.
DOI : 10.1016/j.entcs.2012.10.008
URL : https://hal.archives-ouvertes.fr/hal-00622137

A. Shamir, A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs, SIAM Journal on Computing, vol.8, issue.4, pp.645-655, 1979.
DOI : 10.1137/0208051