T. Achterberg, T. Koch, A. Martin, and . Miplib, MIPLIB 2003, Operations Research Letters, vol.34, issue.4, pp.361-372, 2003.
DOI : 10.1016/j.orl.2005.07.009

S. B. Akers, Binary Decision Diagrams, IEEE Transactions on Computers, vol.27, issue.6, pp.509-516, 1978.
DOI : 10.1109/TC.1978.1675141

G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, and R. Sebastiani, A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions, Lecture Notes in Computer Science, vol.2392, pp.195-210
DOI : 10.1007/3-540-45620-1_17

F. Baader and T. Nipkow, Term Rewriting and All That, 1998.

L. Bachmair, A. Tiwari, and L. Vigneron, Abstract Congruence Closure, Journal of Automated Reasoning, vol.31, issue.2, pp.129-168, 2003.
DOI : 10.1023/B:JARS.0000009518.26415.49
URL : https://hal.archives-ouvertes.fr/inria-00099511

L. Bachmair, N. Dershowitz, and J. Hsiang, Orderings for equational proofs, Proc. 1st IEEE Symp. Logic in Computer Science, pp.346-357, 1986.

L. Bachmair and A. Tiwari, Abstract Congruence Closure and Specializations, Lecture Notes in Computer Science, vol.1831, pp.64-78, 2000.
DOI : 10.1007/10721959_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.3714

T. Ball, E. Bounimova, R. Kumar, and V. Levin, Slam2: Static driver verification with under 4% false alarms, pp.35-42, 2010.

U. Banerjee, Dependence Analysis for Supercomputing, 1988.
DOI : 10.1007/978-1-4684-6894-6

J. Barnes, High Integrity Software: The SPARK Approach to Safety and Security, 2003.

M. Barnett, R. Deline, B. Jacobs, . Bor-yuh-evan, K. Chang et al., Boogie: A Modular Reusable Verifier for Object-Oriented Programs, FMCO, 2005.
DOI : 10.1007/11804192_17

C. Barrett and S. Berezin, CVC Lite: A New Implementation of the Cooperating Validity Checker, Proceedings of the 16 th International Conference on Computer Aided Verification, pp.515-518
DOI : 10.1007/978-3-540-27813-9_49

C. Barrett, M. Deters, L. De-moura, A. Oliveras, and A. Stump, 6 Years of SMT-COMP, Journal of Automated Reasoning, vol.21, issue.4
DOI : 10.1007/s10817-012-9246-5

C. Barrett, D. Dill, and J. Levitt, Validity checking for combinations of theories with equality, pp.187-201, 1996.
DOI : 10.1007/BFb0031808

C. Barrett, R. Nieuwenhuis, A. Oliveras, and C. Tinelli, Splitting on Demand in SAT Modulo Theories, Proceedings of the 13 th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR '06), pp.512-526, 2006.
DOI : 10.1007/11916277_35

C. Barrett, A. Stump, C. Tinelli, S. The, and . Standard, Version 2.0, Proceedings of the 8th International Workshop on Satisfiability Modulo Theories, p.2010

C. Barrett, C. Tinelli, and . Cvc3, CVC3, 19th International Conference on Computer Aided Verification, pp.298-302, 2007.
DOI : 10.1007/978-3-540-73368-3_34

C. W. Barrett, Checking Validity of Quantifier-Free Formulas in Combinations of First-Order Theories, 2003.

F. Bobot, S. Conchon, É. Contejean, M. Iguernelala, S. Lescuyer et al., The Alt-Ergo automated theorem prover, pp.10-33, 2008.

F. Bobot, S. Conchon, E. Contejean, M. Iguernelala, A. Mahboubi et al., A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic, IJCAR 2012: Proceedings of the 6th International Joint Conference on Automated Reasoning, pp.67-81, 2012.
DOI : 10.1007/978-3-642-31365-3_8
URL : https://hal.archives-ouvertes.fr/hal-00687640

M. Bofill, R. Nieuwenhuis, A. Oliveras, E. Rodríguez-carbonell, and A. Rubio, A Write-Based Solver for SAT Modulo the Theory of Arrays, 2008 Formal Methods in Computer-Aided Design, pp.1-8, 2008.
DOI : 10.1109/FMCAD.2008.ECP.18

M. Brain, D. Vijay, A. Silva, L. Griggio, D. Haller et al., Interpolation-based verification of floating-point programs with Bibliography abstract CDCL, Static Analysis Symposium (SAS), pp.412-432

R. Bruttomesso, A. Cimatti, A. Franzen, A. Griggio, and R. Sebastiani, Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis, Annals of Mathematics and Artificial Intelligence, vol.34, issue.3, pp.63-99, 2009.
DOI : 10.1007/s10472-009-9152-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.6356

R. Bruttomesso, R. Cimatti, A. Franzén, A. Griggio, and R. Sebastiani, The mathsat 4 smt solver (tool paper), 2008.

A. Cimatti, A. Griggio, B. Schaafsma, and R. Sebastiani, The MathSAT5 SMT Solver, Proceedings of TACAS, 2013.
DOI : 10.1007/978-3-642-36742-7_7

S. Conchon and É. Contejean, The Alt-Ergo automatic theorem prover. http://alt-ergo.lri.fr APP deposit under the number, 2008.

É. Sylvain-conchon, M. Contejean, and . Iguernelala, Ground Associative and Commutative Completion Modulo Shostak Theories

É. Sylvain-conchon, M. Contejean, and . Iguernelala, Canonized Rewriting and Ground AC Completion Modulo Shostak Theories, Tools and Algorithms for the Construction and Analysis of Systems, pp.45-59, 2011.
DOI : 10.1145/357073.357079

É. Sylvain-conchon, M. Contejean, and . Iguernelala, Canonized rewriting and ground AC completion modulo Shostak theories : Design and implementation Selected Papers of the Conference Tools and Algorithms for the Construction and Analysis of Systems, Logical Methods in Computer Science, vol.8, issue.3, pp.1-29, 2011.

É. Sylvain-conchon, J. Contejean, S. Kanig, and . Lescuyer, CC(X): Semantic Combination of Congruence Closure with Solvable Theories, Post-proceedings of the 5th International Workshop on Satisfiability Modulo Theories, pp.51-69, 2007.
DOI : 10.1016/j.entcs.2008.04.080

S. Conchon and S. Krsti´ckrsti´c, Strategies for combining decision procedures, Theoretical Computer Science, vol.354, issue.2, pp.187-210, 2006.
DOI : 10.1016/j.tcs.2005.11.025

G. Sylvain-conchon, C. Melquiond, M. Roux, and . Iguernelala, Built-in treatment of an axiomatic floating-point theory for SMT solvers, pp.12-21

É. Contejean, A Certified AC Matching Algorithm, 15th International Conference on Rewriting Techniques and Applications, pp.70-84, 2004.
DOI : 10.1007/978-3-540-25979-4_5

H. Thomas, C. Cormen, R. L. Stein, C. E. Rivest, and . Leiserson, Introduction to Algorithms. McGraw-Hill Higher Education, 2001.

G. Dantzig, Linear Programming and Extensions, 1963.
DOI : 10.1515/9781400884179

M. Davis, G. Logemann, and D. Loveland, A machine program for theorem-proving, Communications of the ACM, vol.5, issue.7, pp.394-397, 1962.
DOI : 10.1145/368273.368557

L. De-moura and B. Dutertre, Yices: An SMT Solver

L. De, M. , and N. Bjørner, Z3, an efficient SMT solver, pp.33-72

L. De, M. , and N. Bjørner, Z3, an efficient SMT solver, TACAS, pp.337-340

L. De, M. , and N. Bjørner, Engineering dpll(t) + saturation

L. De, M. , and B. Dutertre, Yices: An SMT Solver

L. Mendonça-de-moura and N. Bjørner, Model-based Theory Combination, Electronic Notes in Theoretical Computer Science, vol.198, issue.2, pp.37-49, 2008.
DOI : 10.1016/j.entcs.2008.04.079

L. Mendonça-de-moura and N. Bjørner, Generalized, efficient array decision procedures, FMCAD, pp.45-52, 2009.

L. Mendonça-de-moura and D. Jovanovic, A Model-Constructing Satisfiability Calculus, Lecture Notes in Computer Science, vol.7737, pp.1-12
DOI : 10.1007/978-3-642-35873-9_1

N. Dershowitz, Orderings for term-rewriting systems, Theoretical Computer Science, vol.17, issue.3, pp.279-301, 1982.
DOI : 10.1016/0304-3975(82)90026-3

N. Dershowitz and J. Jouannaud, Rewrite Systems, pp.243-320, 1990.
DOI : 10.1016/B978-0-444-88074-1.50011-1

D. Detlefs, G. Nelson, and J. B. Saxe, Simplify: a theorem prover for program checking, Journal of the ACM, vol.52, issue.3, pp.365-473, 2005.
DOI : 10.1145/1066100.1066102

L. David and . Dill, A retrospective on murphi, 25 Years of Model Checking, pp.77-88, 2008.

I. Dillig, T. Dillig, and A. Aiken, Cuts from proofs: A complete and practical technique for solving linear inequalities over integers, Proceedings LNCS, vol.5643, issue.74, pp.233-247, 2009.

C. Dross, J. Sylvain-conchon, A. Kanig, and . Paskevich, Reasoning with triggers
URL : https://hal.archives-ouvertes.fr/hal-00703207

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

B. Dutertre and L. De-moura, The Yices SMT solver, 2006.

N. Eén and N. Sörensson, An Extensible SAT-solver, Lecture Notes in Computer Science, vol.2919, pp.502-518, 2003.
DOI : 10.1007/978-3-540-24605-3_37

N. Een and N. Sörensson, An extensible sat-solver [ver 1, 2003.

G. Farkas, Über die theorie der einfachen ungleichungen, Journal für die Reine und Angewandte Mathematik, vol.124, pp.1-27, 1902.

J. Filliâtre, S. Owre, H. Rueß, and N. Shankar, ICS: Integrated Canonizer and Solver?, Proceedings of CAV'2001, pp.246-249, 2001.
DOI : 10.1007/3-540-44585-4_22

J. Filliâtre and A. Paskevich, Why3 ??? Where Programs Meet Provers, Proceedings of the 22nd European Symposium on Programming, pp.125-128, 2013.
DOI : 10.1007/978-3-642-37036-6_8

A. Goel, S. Krsti´ckrsti´c, and A. Fuchs, Deciding array formulas with frugal axiom instantiation, Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning, SMT '08/BPR '08, pp.12-17, 2008.
DOI : 10.1145/1512464.1512468
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.608.9297

A. Griggio, A practical approach to satisability modulo linear integer arithmetic, Journal on Satisfiability, Boolean Modeling and Computation, vol.8, pp.1-27

A. Griggio, B. Schaafsma, A. Cimatti, and R. Sebastiani, MathSAT 5: An SMT Solver for Formal Verification, pp.25-33

J. Guitton, J. Kanig, and Y. Moy, Why Hi-Lite Ada? In Boogie 2011: First International Workshop on Intermediate Verification Languages, pp.27-39, 2011.

A. Gupta, M. K. Ganai, and C. Wang, SAT-Based Verification Methods and Applications in Hardware Verification, SFM, pp.108-143, 2006.
DOI : 10.1007/3-540-45657-0_19

L. Haller, A. Griggio, M. Brain, and D. Kroening, Deciding floating-point logic with systematic abstraction, pp.131-140

J. Hullot, Associative commutative pattern matching, Proc. 6th IJCAI, pp.406-412, 1979.

J. and H. Kirchner, Completion of a set of rules modulo a set of equations, SIAM Journal on Computing, vol.15, issue.4, 1986.

D. Jovanovic and L. De-moura, Cutting to the Chase Solving Linear Integer Arithmetic, CADE-23 Proceedings, pp.338-353, 2011.
DOI : 10.1145/1217856.1217859

D. Kapur, Shostak's congruence closure as completion, Proceedings of the 8th International Conference on Rewriting Techniques and Applications, p.23, 1997.
DOI : 10.1007/3-540-62950-5_59

D. Kapur and C. G. Zarba, A reduction approach to decision procedures, 2006.

L. Khachiyan, Fourier-motzkin elimination method, Encyclopedia of Optimization, pp.1074-1077, 2009.

H. Kim, F. Somenzi, and H. Jin, Efficient Term-ITE Conversion for Satisfiability Modulo Theories, Lecture Notes in Computer Science, vol.1, issue.2, pp.195-208, 2009.
DOI : 10.1007/11814948_17

E. Donald, P. B. Knuth, and . Bendix, Simple word problems in universal algebras, Computational Problems in Abstract Algebra, pp.263-297, 1970.

K. Korovin and A. Voronkov, Solving Systems of Linear Inequalities by Bound Propagation, CADE-23 Proceedings, pp.369-383, 2011.
DOI : 10.1145/1217856.1217859

D. Kroening and O. Strichman, Decision Procedures: An Algorithmic Point of View, pp.25-26, 2008.
DOI : 10.1007/978-3-662-50497-0

S. Krsti´ckrsti´c and S. Conchon, Canonization for disjoint unions of theories Information and Computation, pp.87-106, 2005.

S. Krstic and A. Goel, Architecting solvers for sat modulo theories: Nelsonoppen with dpll. frontiers of combining systems, 2007.

D. S. Lankford, Canonical inference. Memo ATP-32, 1975.

S. Dallas, A. M. Lankford, and . Ballantyne, Decision procedures for simple equational theories with permutative axioms: Complete sets of permutative reductions, 1977.

S. Lescuyer, Formalisation et développement d'une tactique réflexive pour la démonstration automatique en Coq, Thèse de doctorat, 2011.

N. G. Leveson and C. S. Turner, An investigation of the Therac-25 accidents, Computer, vol.26, issue.7, pp.18-41, 1993.
DOI : 10.1109/MC.1993.274940

J. L. Lions, Ariane 5 flight 501 failure

C. Marché, On ground AC-completion, 4th International Conference on Rewriting Techniques and Applications, 1991.
DOI : 10.1007/3-540-53904-2_114

C. Marché, Normalized Rewriting: an Alternative to Rewriting modulo a Set of Equations, Journal of Symbolic Computation, vol.21, issue.3, pp.253-288, 1996.
DOI : 10.1006/jsco.1996.0011

W. Mccune, Otter 3.3 reference manual. CoRR, cs, 2003.

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff, Proceedings of the 38th conference on Design automation , DAC '01, pp.530-535, 2001.
DOI : 10.1145/378239.379017

G. Nelson and D. C. Oppen, Simplification by Cooperating Decision Procedures, ACM Transactions on Programming Languages and Systems, vol.1, issue.2, pp.245-257, 1979.
DOI : 10.1145/357073.357079

G. Nelson and D. C. Oppen, Fast Decision Procedures Based on Congruence Closure, Journal of the ACM, vol.27, issue.2, pp.356-364, 1980.
DOI : 10.1145/322186.322198

G. Nelson, Techniques for Program Verification, NelsonThesis.pdf, 1981.

G. Nelson, Techniques for program verification Research Report CSL-81- 10, Xerox Palo Alto Research Center, 1981.

R. Nieuwenhuis and A. Oliveras, Fast congruence closure and extensions, Information and Computation, vol.205, issue.4, pp.557-580, 2005.
DOI : 10.1016/j.ic.2006.08.009

R. Nieuwenhuis, A. Oliveras, and C. Tinelli, Abstract DPLL and Abstract DPLL Modulo Theories, LPAR'04, LNAI 3452, pp.36-50
DOI : 10.1007/978-3-540-32275-7_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.7679

R. Nieuwenhuis and A. Rubio, A precedence-based total ACcompatible ordering, Proc. 5th Rewriting Techniques and Applications, p.82, 1993.

O. John and . Leary, Theorem proving in intel hardware design, NASA Formal Methods215407 of NASA Conference Proceedings, 2009.

S. Owre, J. M. Rushby, and N. Shankar, PVS: A prototype verification system, 11th International Conference on Automated Deduction, pp.748-752, 1992.
DOI : 10.1007/3-540-55602-8_217

E. Gerald, M. E. Peterson, and . Stickel, Complete sets of reductions for some equational theories, Journal of the ACM, vol.28, issue.2, pp.233-264, 1981.

R. Vaughan and . Pratt, Anatomy of the pentium bug, Lecture Notes in Computer Science, vol.915, pp.97-107, 1995.

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

S. Ranise and C. Tinelli, The Satisfiability Modulo Theories Library (SMT-LIB) http://smtcomp.sourceforge.net, 2006.

A. Riazanov and A. Voronkov, The design and implementation of vampire, AI Commun, vol.15, issue.2-3, pp.91-110, 2002.

R. E. Shostak, An algorithm for reasoning about equality, Communications of the ACM, vol.21, issue.7, pp.583-585, 1978.
DOI : 10.1145/359545.359570

J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM, vol.12, issue.1, pp.23-41, 1965.
DOI : 10.1145/321250.321253

H. Rueß and N. Shankar, Deconstructing Shostak, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, pp.19-28
DOI : 10.1109/LICS.2001.932479

A. Schrijver, Theory of linear and integer programming Wiley-Interscience series in discrete mathematics and optimization, pp.26-35, 1998.

R. E. Shostak, Deciding Combinations of Theories, Journal of the ACM, vol.31, issue.1, pp.1-12, 1984.
DOI : 10.1145/2422.322411

L. Joso and . Silva, Grasp -a new search algorithm for satisfiability, pp.220-227, 1996.

H. J. Smith, On Systems of Linear Indeterminate Equations and Congruences., Proceedings of the Royal Society of London, vol.11, issue.0, pp.86-89
DOI : 10.1098/rspl.1860.0019

W. Snyder, Efficient completion: a o(n.log(n)) algorithm for generating reduced sets of ground rewrite rules equivalent to a set of ground equations e

J. Souyris and D. Favre-félix, Proof of Properties in Avionics, Building the Information Society IFIP International Federation for Information Processing, pp.527-535, 2004.
DOI : 10.1007/978-1-4020-8157-6_48

A. Stump, C. W. Barrett, D. L. Dill, and J. R. Levitt, A decision procedure for an extensional theory of arrays, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, pp.29-37
DOI : 10.1109/LICS.2001.932480

G. Sutcliffe and C. B. Suttner, The TPTP problem library, Journal of Automated Reasoning, vol.21, issue.2, pp.177-203, 1998.
DOI : 10.1007/3-540-58156-1_18

N. Tillmann and J. D. Halleux, Parameterized unit testing with microsoft pex (long tutorial), 2010.
DOI : 10.1007/978-3-642-14335-9_5

A. Tiwari, Combining Equational Reasoning, Lecture Notes in Computer Science, vol.12, issue.2, pp.68-83, 2009.
DOI : 10.1007/11538363_18

E. Viola, E-unifiability via Narrowing, Proceedings of the 7th Italian Conference on Theoretical Computer Science, ICTCS '01, pp.426-438, 2001.
DOI : 10.1007/3-540-45446-2_27

C. Weidenbach, D. Dimova, A. Fietzke, R. Kumar, M. Suda et al., SPASS Version 3.5, Proceedings of the 22nd International Conference on Automated Deduction, CADE-22, pp.140-145, 2009.
DOI : 10.1007/978-3-540-73595-3_38