R. Bagnara, P. M. Hill, and E. Zaffanella, The Parma Polyhedra Library, version 0.9. URL http

S. Basu, R. Pollack, and M. Roy, Algorithms in real algebraic geometry. Algorithms and computation in mathematics, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01083587

R. Aaron, Z. Bradley, and . Manna, Property-directed incremental invariant generation. Formal Aspects of Computing, pp.4-5379, 2008.

J. W. Chinneck, Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program, INFORMS Journal on Computing, vol.9, issue.2, 1997.
DOI : 10.1287/ijoc.9.2.164

J. W. Chinneck, Feasibility and infeasibility in optimization, 2008.

G. Collins, Quantifier elimination for real closed fields by cylindric algebraic decomposition, Automata theory and formal languages, pp.134-183, 1975.

D. C. Cooper, Theorem proving in arithmetic without multiplication, Machine Intelligence 7, pp.91-100, 1972.

S. Cotton, On Some Problems in Satisfiability Solving, 2009.

D. Cox, J. Little, and D. O. Shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 2007.

G. B. Dantzig, D. R. Fulkerson, and S. M. Johnson, Solution of a large-scale traveling-salesman problem In 50 Years of Integer Programming, pp.7-28, 1958.

H. James, J. Davenport, and . Heintz, Real quantifier elimination is doubly exponential, J. Symb. Comput, vol.588, issue.12, pp.29-35, 1988.

J. Ferrante and C. Rackoff, A Decision Procedure for the First Order Theory of Real Addition with Order, SIAM Journal on Computing, vol.4, issue.1, pp.69-76, 1975.
DOI : 10.1137/0204006

J. Michael, M. O. Fischer, and . Rabin, Super-exponential complexity of Presburger arithmetic, Complexity of Computation , number 7 in SIAM?AMS proceedings, pp.27-42, 1974.

U. Junker, QuickXplain: Conflict detection for arbitrary constraint propagation algorithms, IJCAI '01 workshop CONS-1, 2001.

D. Kroening and O. Strichman, Decision procedures, 2008.
DOI : 10.1007/978-3-662-50497-0

R. Loos and V. Weispfenning, Applying Linear Quantifier Elimination, The Computer Journal, vol.36, issue.5, pp.450-462, 1993.
DOI : 10.1093/comjnl/36.5.450

K. L. Mcmillan, A. Kuehlmann, and M. Sagiv, Generalizing DPLL to Richer Logics, LNCS, vol.5643, pp.462-476, 2009.
DOI : 10.1007/978-3-642-02658-4_35

P. Mcmullen and G. C. Shepard, Convex polytopes and the upper bound conjecture lecture note series, 1971.

D. Monniaux, A Quantifier Elimination Algorithm for Linear Real Arithmetic, LPAR (Logic for Programming Artificial Intelligence and Reasoning), pp.243-257, 2008.
DOI : 10.1007/978-3-540-89439-1_18
URL : https://hal.archives-ouvertes.fr/hal-00262312

D. Monniaux, Automatic modular abstractions for linear constraints, POPL (Principles of programming languages, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00336144

D. Monniaux, Optimal abstraction on real-valued programs Static analysis (SAS), LNCS, vol.4634, pp.104-120, 2007.

Y. Moy, Sufficient preconditions for modular assertion checking Verification , Model Checking, and Abstract Interpretation (VMCAI), LNCS, vol.4905, pp.188-202, 2008.

W. Pugh, The Omega test: a fast and practical integer programming algorithm for dependence analysis, Proceedings of the 1991 ACM/IEEE conference on Supercomputing , Supercomputing '91, pp.4-13, 1991.
DOI : 10.1145/125826.125848

P. Darsh, D. Ranjan, S. Tang, and . Malik, A comparative study of 2QBF algorithms, Theory and Applications of Satisfiability Testing (SAT), 2004.