M. P. Bonacina, S. Graham-lengrand, N. E. Shankarbry86-]-r, . [. Bryant, N. Bruttomesso et al., Satisfiability modulo theories and assignments Graph-based algorithms for boolean function manipulation. Computers A scalable decision procedure for fixed-width bit-vectors, Proc. of the 26th Int. Conf. on Automated Deduction (CADE'17) Proceedings of the 2009 International Conference on Computer-Aided Design, ICCAD'09, pp.677-691, 1986.

Z. Chihani, F. Bobot, and S. Bardin, CDCL-inspired Word-level Learning for Bit-vector Constraint Solving. 2017. Preprint. Available at https
URL : https://hal.archives-ouvertes.fr/hal-01531336

D. Cyrluk, O. Möller, and H. Rueß, An efficient decision procedure for the theory of fixedsized bit-vectors, Computer Aided Verification: 9th International Conference, CAV'97, pp.60-71, 1997.

L. M. De-moura and D. Jovanovi´cjovanovi´c, A Model-Constructing Satisfiability Calculus, Proc. of the 14th Int. Conf. on Verification, Model Checking, and Abstract Interpretation (VMCAI'13), pp.1-12, 2013.
DOI : 10.1007/978-3-642-35873-9_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

D. Jovanovi´cjovanovi´c, C. Barrett, L. De-moura, and C. M. Wintersteiger, The design and implementation of the model constructing satisfiability calculus Solving nonlinear integer arithmetic with MCSAT Quickxplain: Conflict detection for arbitrary constraint propagation algorithms On intervals and bounds in bit-vector arithmetic, Proc. of the 13th Int. Conf. on Formal Methods In Computer-Aided Design (FMCAD'13). FMCAD Inc., 2013. [Jov17] D. Jovanovi´cJovanovi´c Proc. of the 18th Int. Conf. on Verification, Model Checking, and Abstract Interpretation (VMCAI'17)Jun01] U. Junker IJCAI'01 Workshop on Modelling and Solving problems with constraints Proc. of the 14th Int. Work. on Satisfiability Modulo Theories (SMT'16), volume 1617 of CEUR Workshop Proceedings, pp.330-346, 2001.

J. M. Silva, I. Lynce, and S. Malik, Conflict-driven clause learning SAT solvers, Handbook of Satisfiability, pp.131-153, 2009.

A. Zeljic, C. M. Wintersteiger, and P. Rümmer, Deciding Bit-Vector Formulas with mcSAT, Proc. of the 19th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT'16), pp.249-266, 2016.
DOI : 10.1007/978-3-642-38088-4_6