. Fdcc, A combined approach for solving constraints over finite domains and arrays, Proceedings of the 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR'12, pp.17-33

H. Bardin, S. Bardin, and P. Herrmann, Structural Testing of Executables, 2008 International Conference on Software Testing, Verification, and Validation, pp.22-31, 2008.
DOI : 10.1109/ICST.2008.8

. Bardin, An Alternative to SAT-Based Approaches for Bit-Vectors, International Conference on Tools and Algorithms for the Construction and Analysis of Systems CVC4. In Computer Aided Verification -23rd International Conference, CAV 2011 Proceedings, pp.84-98, 2010.
DOI : 10.1007/978-3-642-12002-2_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.3358

. Barrett, The SMT-LIB Standard: Version 2.5, 2015.
DOI : 10.1007/978-3-642-19583-9_2

D. Berend and T. Tassa, Improved bounds on bell numbers and on moments of sums of random variables, Probability and Mathematical Statistics, vol.30, issue.2, pp.185-205, 2010.

. Botella, Symbolic execution of floating-point computations, Software Testing, Verification and Reliability, vol.14, issue.2, pp.97-121, 2006.
DOI : 10.1002/stvr.333
URL : https://hal.archives-ouvertes.fr/inria-00540299

. Bozzano, Efficient Satisfiability Modulo Theories via Delayed Theory Combination, Computer Aided Verification, 17th International Conference, CAV 2005 Proceedings, pp.335-349, 2005.
DOI : 10.1007/11513988_34
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.5431

. Bradley, What?s Decidable About Arrays?, Proceedings of the 7th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI'06, pp.427-442, 2006.
DOI : 10.1007/11609773_28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.4969

R. Brummayer and A. Biere, Lemmas on demand for the extensional theory of arrays, 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.1-3165, 2009.
DOI : 10.1145/1512464.1512467

. Bruttomesso, 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.1145/322123.322137
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.6356

. Carlsson, An open-ended finite domain constraint solver, Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education , PLILP '97, pp.191-206, 1997.
DOI : 10.1007/BFb0033845
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.3107

. Charreteur, Modelling Dynamic Memory Management in Constraint- Based Testing, Journal of Systems and Software, issue.11, pp.821755-1766, 2009.
DOI : 10.1109/taicpart.2007.4344106
URL : https://hal.archives-ouvertes.fr/inria-00540270

. Cimatti, The MathSAT5 SMT Solver, Proceedings of TACAS, 2013.
DOI : 10.1007/978-3-642-36742-7_7

M. De, L. Bjørner-]-de-moura, and N. Bjørner, Z3: An efficient smt solver, Proceedings of the Theory and Practice of Software, 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , TACAS'08/ETAPS'08, pp.337-340, 2008.

S. Downey, P. J. Downey, and R. Sethi, Assignment Commands with Array References, Journal of the ACM, vol.25, issue.4, pp.652-666, 1978.
DOI : 10.1145/322092.322104

B. Dutertre, Yices?2.2, Computer-Aided Verification (CAV'2014), pp.737-744, 2014.
DOI : 10.1007/978-3-319-08867-9_49

A. Gotlieb, Euclide: A Constraint-Based Testing Framework for Critical C Programs, 2009 International Conference on Software Testing Verification and Validation, pp.151-160, 2009.
DOI : 10.1109/ICST.2009.10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.179.3013

. Gotlieb, Constraint solving on modular integers, ModRef Worksop, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00699234

C. Hentenryck, P. V. Hentenryck, and J. Carillon, Generality versus specificity: An experience with AI and OR techniques, Proceedings of the 7th National Conference on Artificial Intelligence. St. Paul, MN, pp.660-664, 1988.

J. Jaffar, Minimal and complete word unification, Journal of the ACM, vol.37, issue.1, pp.47-85, 1990.
DOI : 10.1145/78935.78938

. Kroening, . Strichman, D. Kroening, and O. Strichman, Decision Procedures: An Algorithmic Point of View (Chapter Arrays, pp.157-172, 2016.
DOI : 10.1007/978-3-662-50497-0

. Marre, B. Blanc-]-marre, and B. Blanc, Test Selection Strategies for Lustre Descriptions in GATeL, Electronic Notes in Theoretical Computer Science, vol.111, pp.93-111, 2005.
DOI : 10.1016/j.entcs.2004.12.010
URL : http://doi.org/10.1016/j.entcs.2004.12.010

O. Nelson, 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.2828

. Nethercote, MiniZinc: Towards a Standard CP Modelling Language, Principles and Practice of Constraint Programming -CP 2007, 13th International Conference Proceedings, pp.529-543, 2007.
DOI : 10.1007/978-3-540-74970-7_38
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.9321

. Owre, PVS System Guide, 1999.

G. Tack, Views and iterators for generic constraint implementations, Principles and Practice of Constraint Programming -CP 2005, 11th International Conference Proceedings, pp.817-821, 2005.

. Tack, Generating Propagators for Finite Set Constraints, Principles and Practice of Constraint Programming -CP 2006, 12th International Conference Proceedings, pp.575-589, 2006.
DOI : 10.1007/11889205_41
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.5386