S. Ali, M. Z. Iqbal, A. Arcuri, and L. C. Briand, A Search-Based OCL Constraint Solver for Model-Based Test Data Generation, 2011 11th International Conference on Quality Software, pp.41-50, 2011.
DOI : 10.1109/QSIC.2011.17

K. Anastasakis, B. Bordbar, G. Georg, and I. Ray, On challenges of model transformation from UML to Alloy. Software and Systems Modeling, pp.69-86, 2010.

N. Bjørner, N. Tillmann, and A. Voronkov, Path Feasibility Analysis for String-Manipulating Programs, LNCS, vol.0, issue.7, pp.307-321, 2009.
DOI : 10.1007/978-3-540-79124-9_10

F. Büttner and J. Cabot, Lightweight String Reasoning for OCL, Modelling Foundations and Applications -8th European Conference, ECMFA 2012, Proceedings, pp.244-258, 2012.
DOI : 10.1007/978-3-642-31491-9_19

J. Cabot, R. Clarisó, and D. Riera, UMLtoCSP, Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering , ASE '07, 2007.
DOI : 10.1145/1321631.1321737

M. Cadoli, D. Calvanese, G. D. Giacomo, and T. Mancini, Finite Satisfiability of UML Class Diagrams by Constraint Programming, Proc. of the CP 2004 Workshop on CSP Techniques with Immediate Application, 2004.

M. Clavel, M. Egea, and M. A. De-dios, Checking Unsatisfiability for OCL Constraints, Electronic Communications of the EASST, vol.24, pp.1-13, 2009.

K. Ehrig, J. Küster, and G. Taentzer, Generating instance models from meta models. Software and Systems Modeling, pp.479-500, 2009.
DOI : 10.1007/s10270-008-0095-y
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.527.7171

T. W. Frühwirth, Constraint handling rules, Proceedings of the 8th ACM SIGPLAN symposium on Principles and practice of declarative programming , PPDP '06, pp.90-107, 1994.
DOI : 10.1145/1140335.1140337

T. W. Frühwirth, Constraint handling rules, Proceedings of the 8th ACM SIGPLAN symposium on Principles and practice of declarative programming , PPDP '06, pp.13-14, 2006.
DOI : 10.1145/1140335.1140337

K. Golden and W. Pang, Constraint Reasoning over Strings, Principles and Practice of Constraint Programming -CP 2003, 2003.
DOI : 10.1007/978-3-540-45193-8_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.7459

C. A. González-pérez, F. Buettner, R. Clarisó, and J. Cabot, EMFtoCSP: A tool for the lightweight verification of EMF models, 2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA), 2012.
DOI : 10.1109/FormSERA.2012.6229788

C. A. González, F. Büttner, R. Clarisó, and J. Cabot, EMFtoCSP: A tool for the lightweight verification of EMF models, 2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA), 2012.
DOI : 10.1109/FormSERA.2012.6229788

P. Hooimeijer and M. Veanes, An Evaluation of Automata Algorithms for String Analysis, LNCS, vol.4, issue.4, pp.248-262, 2011.
DOI : 10.1007/978-3-642-00768-2_28

P. Hooimeijer and W. Weimer, StrSolve: solving string constraints lazily, Automated Software Engineering, vol.83, issue.12, pp.531-559, 2012.
DOI : 10.1007/s10515-012-0111-x

D. Jackson, Alloy: a lightweight object modelling notation, ACM Transactions on Software Engineering and Methodology, vol.11, issue.2, pp.256-290, 2002.
DOI : 10.1145/505145.505149

S. Jha, S. A. Seshia, and R. Limaye, On the Computational Complexity of Satisfiability Solving for String Theories, pp.1-11, 2009.

A. Kiezun, V. Ganesh, S. Artzi, P. H. Philip-guo, and M. Ernst, HAMPI, ACM Transactions on Software Engineering and Methodology, vol.21, issue.4, p.2012
DOI : 10.1145/2377656.2377662

M. Kuhlmann, L. Hamann, and M. Gogolla, Extensive Validation of OCL Models by Integrating SAT Solving into USE, LNCS, vol.201, issue.6705, pp.290-306, 2011.
DOI : 10.1007/978-3-642-21952-8_21

H. Malgouyres and G. Motet, A UML model consistency verification approach based on meta-modeling formalization, Proceedings of the 2006 ACM symposium on Applied computing , SAC '06, pp.1804-1809, 2006.
DOI : 10.1145/1141277.1141703

A. Maraee and M. Balaban, Efficient reasoning about finite satisfiability of UML class diagrams with constrained generalization sets Model driven architecture-foundations and applications, ECMDA-FA'07, Proceedings of the 3rd European conference on 23. OMG. Object Constraint Language Specification, version 2.3.1 (Document formal, pp.17-31, 2007.

A. Queralt and E. Teniente, Verification and Validation of UML Conceptual Schemas with OCL Constraints, ACM Transactions on Software Engineering and Methodology, vol.21, issue.2, p.13, 2012.
DOI : 10.1145/2089116.2089123

F. Rossi, P. Van-beek, and T. Walsh, Handbook of constraint programming, 2006.

J. Schimpf and K. Shen, ECLiPSe ? From LP to CLP. Theory and Practice of Logic Programming, pp.127-156, 2012.

J. Sneyers, P. V. Weert, T. Schrijvers, and L. D. Koninck, Abstract, Theory and Practice of Logic Programming, vol.10, issue.01, pp.1-47, 2010.
DOI : 10.1145/1069774.1069795

M. Soeken, R. Wille, and R. Drechsler, Encoding OCL Data Types for SAT-Based Verification of UML/OCL Models, LNCS, vol.5, issue.1-2, pp.152-170, 2011.
DOI : 10.1016/S0747-7171(88)80004-X

E. Torlak and D. Jackson, Kodkod: A Relational Model Finder Tools and Algorithms for the Construction and Analysis of Systems, 13th International Conference, TACAS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, 2007.

M. Veanes, P. De-halleux, and N. Tillmann, Rex: Symbolic Regular Expression Explorer, 2010 Third International Conference on Software Testing, Verification and Validation, pp.498-507, 2010.
DOI : 10.1109/ICST.2010.15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.177.8896

J. Winkelmann, G. Taentzer, K. Ehrig, and J. M. Küster, Translation of Restricted OCL Constraints into Graph Constraints for Generating Meta Model Instances by Graph Grammars, Electronic Notes in Theoretical Computer Science, vol.211, pp.159-170, 2008.
DOI : 10.1016/j.entcs.2008.04.038