, Créer une première version d'un méta-modèle en choisissant un thème parmi une liste proposée (architecture de maison, organigramme d'entreprise, ou bien proposer son propre thème

, Utiliser Grimm pour générer un modèle conforme à la version courante du méta-moo dèle

, Vérifier si le modèle permet de trouver une erreur de modélisation, alors dire que l'étape a été utile puis aller à l'étape 4

, Modifier le méta-modèle de façon à corriger l'erreur détectée puis aller à l

, Répondre à un questionnaire sur l'utilisation de l'outil et son ergonomie

, Le questionnaire porte sur les points suivants : ? Pour chaque étape

, Si une erreur a été détectée, préciser la partie du méta-modèle qu'elle concerne

, Donner des remarques ou suggestions pour améliorer l'ergonomie de l'outil. ? Dire si l'outil vous a satisfait

R. Al-msie-'deen, Reverse Engineering Feature Models from Software Variants to Build Software Product Lines, 2014.
URL : https://hal.archives-ouvertes.fr/tel-01015102

K. Apt and M. Wallace, Constraint logic programming using Eclipse, 2007.
DOI : 10.1017/CBO9780511607400
URL : http://araku.ac.ir/~d_comp_engineering/88892/1323163/Eclipse.pdf

C. Ashworth and M. Goodland, SSADM : A practical approach, 1990.

F. Aurenhammer, Voronoi diagrams---a survey of a fundamental geometric data structure, ACM Computing Surveys, vol.23, issue.3, pp.345-405, 1991.
DOI : 10.1145/116873.116880
URL : http://drona.csa.iisc.ernet.in/~gsat/Course/CombGeom08/papers/voronoi-survey.pdf

B. Baudry, S. Ghosh, F. Fleurey, R. France, Y. L. Traon et al., Barriers to systematic model transformation testing, Communications of the ACM, vol.53, issue.6, pp.139-143, 2010.
DOI : 10.1145/1743546.1743583
URL : https://hal.archives-ouvertes.fr/inria-00542747

N. Beldiceanu and H. Simonis, A Model Seeker: Extracting Global Constraint Models from Positive Examples, CP, International Conference on Principles and Practice of Constraint Programming, pp.141-157, 2012.
DOI : 10.1007/978-3-642-33558-7_13
URL : https://hal.archives-ouvertes.fr/hal-00754361

C. Bessiere, R. Coletta, E. Hebrard, G. Katsirelos, N. Lazaar et al., Constraint Acquisition via Partial Queries, IJCAI, International Joint Conference on Artificial Intelligence, pp.475-481, 2013.
URL : https://hal.archives-ouvertes.fr/lirmm-00830325

C. Bessière and P. Hentenryck, To Be or Not to Be ... a Global Constraint, CP, International Conference on Principles and Practice of Constraint Programming, pp.789-794, 2003.
DOI : 10.1007/978-3-540-45193-8_54

G. Booch, Object-oriented Analysis and Design with Applications, 1994.

F. Boufares, H. Bennaceur, H. Bennaceur, and A. Osmani, Consistency problems in ER-schemas for database systems, ISPE, International Conference on Enhanced Interoperable Systems, pp.263-274, 2003.
DOI : 10.1016/j.ins.2003.06.015
URL : https://hal.archives-ouvertes.fr/hal-00083795

G. Box and M. Muller, A Note on the Generation of Random Normal Deviates, The Annals of Mathematical Statistics, vol.29, issue.2, pp.610-611, 1958.
DOI : 10.1214/aoms/1177706645
URL : http://doi.org/10.1214/aoms/1177706645

E. Brottier, F. Fleurey, J. Steel, B. Baudry, and Y. L. Traon, Metamodel-based Test Generation for Model Transformations: an Algorithm and a Tool, 2006 17th International Symposium on Software Reliability Engineering, pp.85-94, 2006.
DOI : 10.1109/ISSRE.2006.27
URL : http://www.irisa.fr/triskell/publis/2006/Brottier06a.pdf

C. A. Brown, L. Finkelstein, and P. W. Purdom-jr, Backtrack searching in the presence of symmetry, AAECC, International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pp.99-110, 1989.
DOI : 10.1007/3-540-51083-4_51

J. Cabot, R. Clarisó, and D. Riera, Verification of UML/OCL Class Diagrams using Constraint Programming, ICSTW, IEEE International Conference on Software Testing Verification and Validation Workshop, pp.73-80, 2008.
DOI : 10.1109/icstw.2008.54
URL : https://hal.archives-ouvertes.fr/hal-00974321

J. Cabot, R. Clarisó, and D. Riera, Verifying UML/OCL Operation Contracts, IFM, International Conference on Integrated Formal Methods, pp.40-55, 2009.
DOI : 10.1145/299917.299919
URL : http://gres.uoc.edu/pubs/iFM09.pdf

J. Cabot, R. Clarisó, and D. Riera, On the verification of UML/OCL class diagrams using constraint programming, Journal of Systems and Software, vol.93, issue.0, pp.1-23, 2014.
DOI : 10.1016/j.jss.2014.03.023
URL : https://hal.archives-ouvertes.fr/hal-00974321

J. Cadavid, B. Baudry, and B. Combemale, Empirical evaluation of the conjunct use of MOF and OCL, EESSMod, Experiences and Empirical Studies in Software Modelling, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00647347

J. Cadavid, B. Baudry, and H. Sahraoui, Searching the Boundaries of a Modeling Space to Test Metamodels, ICST, IEEE Conference on Software Testing, Verififi cation and Validation, pp.131-140, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00665866

J. J. Cadavid, Assisting precise Metamodeling, 2012.

M. Cadoli, D. Calvanese, G. D. Giacomo, and T. Mancini, Finite Model Reasoning on UML Class Diagrams Via Constraint Programming, AI IA : Italian Association for Artificial Intelligence Congress, pp.36-47, 2007.
DOI : 10.1007/978-3-540-74782-6_5
URL : http://www.dis.uniroma1.it/~degiacom/papers/2007/cado-calv-degi-manc-AIIA-2007.pdf

V. ?ern, Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, Journal of Optimization Theory and Applications, vol.21, issue.1, pp.41-51, 1985.
DOI : 10.1007/BF00940812

A. Chateau and R. Giroudeau, Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem, AlCoB, International Conference on Algorithms for Computational Biology, pp.47-58, 2014.
DOI : 10.1007/978-3-319-07953-0_4
URL : https://hal.archives-ouvertes.fr/lirmm-01007556

A. Chateau and R. Giroudeau, A complexity and approximation framework for the maximization scaffolding problem, Theoretical Computer Science, vol.595, pp.92-106, 2015.
DOI : 10.1016/j.tcs.2015.06.023
URL : https://hal.archives-ouvertes.fr/lirmm-01219622

C. Team, CHOCO : an Open Source Java Constraint Programming Library, Research report, 2010.

A. and C. Geniet, Les réseaux de Petri : Un Outil de Modélisation Cours et Exerr cices Corrigés. Dunod, 2006.

E. F. Codd, A relational model of data for large shared data banks, Communications of the ACM, vol.13, issue.6, pp.377-387, 1970.
DOI : 10.1145/362384.362685

J. Crawford, M. Ginsberg, E. Luks, and A. Roy, Symmetry-Breaking Predicates for Search Problems, KR, International Conference on Principles of Knowledge Representation and Reasoning, pp.148-159, 1996.

L. M. De-moura and N. Bjørner, Satisfiability modulo theories, Communications of the ACM, vol.54, issue.9, pp.69-77, 2011.
DOI : 10.1145/1995376.1995394
URL : https://hal.archives-ouvertes.fr/hal-01095009

K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, vol.6, issue.2, pp.182-197, 2002.
DOI : 10.1109/4235.996017
URL : http://work.caltech.edu/amrit/papers/nsga2.ps.gz

K. Ehrig, J. M. Kister, G. Taentzer, and J. Winkelmann, Generating Instance Models from Meta Models, FMOODS, Formal Methods for Open Object-Based Distributed Systems, pp.156-170, 2006.
DOI : 10.1007/s10270-008-0095-y
URL : https://link.springer.com/content/pdf/10.1007%2F11768869_13.pdf

K. Ehrig, J. Küster, and G. Taentzer, Generating Instance Models from Meta models. SoSyM, Software and Systems Modeling, pp.479-500, 2009.
DOI : 10.1007/s10270-008-0095-y
URL : https://link.springer.com/content/pdf/10.1007%2F11768869_13.pdf

J. Falleri, M. Huchard, M. Lafourcade, and C. Nebut, Metamodel Matching for Automatic Model Transformation Generation, Model Driven Engineering Languages and Systems, pp.326-340, 2008.
DOI : 10.1007/978-3-540-87875-9_24
URL : https://hal.archives-ouvertes.fr/lirmm-00322879

A. Ferdjoukh, Grimm : un assistant à la conception de méta-modèles par génération d'instances

A. Ferdjoukh, A. Baert, E. Bourreau, A. Chateau, R. Coletta et al., Instantiation of Meta-models Constrained with OCL : a CSP Approach A CSP Approach for Metamodel Instantiation, MOO DELSWARD, International Conference on Model-Driven Engineering and Software Development ICTAI, IEEE International Conference on Tools with Artificial Intelligence, pp.213-222, 2013.

A. Ferdjoukh, E. Bourreau, A. Chateau, and C. Nebut, A Model-Driven Approach to Generate Relevant and Realistic Datasets, Proceedings of the 28th International Conference on Software Engineering and Knowledge Engineering, pp.105-109, 2016.
DOI : 10.18293/SEKE2016-029
URL : https://hal.archives-ouvertes.fr/lirmm-01397311

F. Fleurey, B. Baudry, P. Muller, and Y. Traon, Qualifying input test data for model transformations. SoSyM, Software & Systems Modeling, pp.185-203, 2009.
DOI : 10.1007/s10270-007-0074-8
URL : https://hal.archives-ouvertes.fr/hal-00880639

F. Focacci and M. Milano, Global Cut Framework for Removing Symmetries, CP, International Conference on Principles and Practice of Constraint Programming, pp.77-92, 2001.
DOI : 10.1007/3-540-45578-7_6

L. C. Freeman, Centrality in social networks conceptual clarification, Social Networks, vol.1, issue.3, pp.215-239, 1978.
DOI : 10.1016/0378-8733(78)90021-7
URL : http://www.cin.ufpe.br/%7Erbcp/taia/Freeman1979-centrality.pdf

A. Fron, Programmation par Contraintes. Vuibert, 1994.

F. Galinier, Des algorithmes génétiques pour générer des modèles diversifiés, 2016.

F. Galinier, E. Bourreau, A. Chateau, A. Ferdjoukh, and C. Nebut, Genetic Algoo rithm to Improve Diversity in MDE, META, International Conference on Metaa heuristics and Nature Inspired Computing, p.2016

L. Gammaitoni, P. Kelsen, and F. Mathey, Verifying Modelling Languages using Lightning : a Case Study, MoDeVVa@MODELS, Workshop on Model-Driven Engineering, Verification and Validation co-located with International Conference on Model Driven Engineering Languages and Systems, pp.19-28

X. Gao, B. Xiao, D. Tao, and X. Li, A survey of graph edit distance. Pattern Analysis and applications, pp.113-129, 2010.
DOI : 10.1007/s10044-008-0141-y

I. Gent, E. Macintyre, P. Presser, B. M. Smith, and T. Walsh, An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem, pp.179-193, 1996.
DOI : 10.1007/3-540-61551-2_74
URL : http://www.dcs.st-and.ac.uk/~apes/papers/CRCcp96gmpsw.ps.gz

I. P. Gent and B. M. Smith, Symmetry Breaking in Constraint Programming, ECAI, European Conference on Artificial Intelligence, pp.599-603, 2000.

M. Gogolla, J. Bohling, and M. Richters, Validating UML and OCL models in USE by automatic snapshot generation. SoSyM, Software & Systems Modeling, pp.386-398, 2005.
DOI : 10.1007/s10270-005-0089-y
URL : http://www.db.informatik.uni-bremen.de/publications/Gogolla_2005_SOSYM.ps

M. Gogolla, F. Büttner, and M. Richters, USE : A UML-based specification enn vironment for validating UML and OCL, Science of Computer Programming, vol.69, pp.1-327, 2007.
DOI : 10.1016/j.scico.2007.01.013
URL : https://doi.org/10.1016/j.scico.2007.01.013

D. E. Goldberg and J. H. Holland, Genetic algorithms and machine learning, Machine Learning, vol.3, issue.2/3, pp.95-99, 1988.
DOI : 10.1023/A:1022602019183

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), pp.44-50, 2012.
DOI : 10.1109/FormSERA.2012.6229788

R. W. Hamming, Error Detecting and Error Correcting Codes, Bell System Technical Journal, vol.29, issue.2, pp.147-160, 1950.
DOI : 10.1002/j.1538-7305.1950.tb00463.x
URL : https://calhoun.nps.edu/bitstream/10945/46756/1/Hamming_1982.pdf

D. , Statecharts: a visual formalism for complex systems, Science of Comm puter Programming, pp.231-274, 1987.
DOI : 10.1016/0167-6423(87)90035-9

J. A. Hartigan, Classification and Clustering, Journal of Marketing Research, vol.18, issue.4, 1975.
DOI : 10.2307/3151350

B. Henderson-sellers, Object-Oriented Metrics : Measures of Complexity, 1996.

J. H. Holland, Adaptation in natural and artificial systems : an introductory analysis with applications to biology, control, and artificial intelligence, 1975.

D. Jackson, Software Abstractions : logic, language, and analysis, 2012.

I. Jacobson, Object-oriented Software Engineering : a Use Case Driven Approach, 1992.

J. Jézéquel, B. Combemale, and D. Vojtisek, Ingénierie Dirigée par les Modèles : des concepts à la pratique, 2012.

E. Juliot and J. Benois, Viewpoints creation using Obeo Designer or how to build Eclipse DSM without being an expert developer. Obeo Designer Whitepaper, 2010.

Z. A. Karian and E. J. Dudewicz, Handbook of Fitting Statistical Distributions with R, 2012.
DOI : 10.1201/b10159

S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

D. S. Kolovos, L. M. Rose, S. B. Abid, R. F. Paige, F. A. Polack et al., Botterr weck. Taming EMF and GMF Using Model Transformation JaCoP Library User's Guide, version 4, 65] J. Larrosa and P. Meseguer. Exploiting the use of DAC in Max-CSP. In CP, Interr national Conference on Principles and Practice of Constraint Programming, pp.211-225, 1996.

C. Lecoutre and O. Roussel, XML Representation of Constraint Networks, Computing Research Repository ACM Journal, vol.9, issue.2, pp.2362-2370, 2009.
DOI : 10.1002/9780470611821.app2
URL : https://hal.archives-ouvertes.fr/hal-00872825

A. Lindebaum, Contributions ?? l'??tude de l'espace m??trique I, Fundamenta Mathematicae, vol.8, issue.1, pp.209-222, 1926.
DOI : 10.4064/fm-8-1-209-222

A. Mackworth, Consistency in networks of relations, Consistency in Networks of Relations, pp.99-118, 1977.
DOI : 10.1016/0004-3702(77)90007-8

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

M. Marriott, Caste ranking and community structure in five regions of India and Pakistan, Bulletin of the Deccan College Research Institute, vol.19, issue.12, pp.31-105, 1958.

S. Melnik, H. Garcia-molina, and E. Rahm, Similarity flooding: a versatile graph matching algorithm and its application to schema matching, Proceedings 18th International Conference on Data Engineering, pp.117-128, 2002.
DOI : 10.1109/ICDE.2002.994702
URL : http://ella.slis.indiana.edu/~katy/L597-F04/sim-flood.pdf

S. Merchez, C. Lecoutre, and F. Boussemart, AbsCon: A Prototype to Solve CSPs with Abstraction, CP, International Conference on Principles and Practice of Constraint Programming, pp.730-744, 2001.
DOI : 10.1007/3-540-45578-7_59
URL : http://www.cril.univ-artois.fr/~lecoutre/research/CP2001.ps

M. Mitzenmacher and E. Upfal, Probability and Computing : Randomized Algorithms and Probabilistic Analysis, 2005.
DOI : 10.1017/CBO9780511813603

A. Mougenot, A. Darrasse, X. Blanc, and M. Soria, Uniform Random Generation of Huge Metamodel Instances, ECMDA, European Conference on Model-Driven Architecture Foundations and Applications, pp.130-145, 2009.
DOI : 10.1109/MS.2003.1231146
URL : https://hal.archives-ouvertes.fr/hal-00391816

P. Muller, F. Fondement, B. Baudry, and B. Combemale, Modeling modeling mode ling. SoSyM, Software and System Modeling, pp.347-359, 2012.

, Meta-Object Facility Specification Available at : http ://www.omg.org/spec, 2002.

O. and O. Management-group, Object Constraint Language Specification, Verr sion 2.4. Official Specification, 2014.

L. Page, S. Brin, R. Motwani, and T. Winograd, The PageRank citation ranking : bringing order to the web, 1999.

C. A. Petri, Communication with Automata, Defense Technical Information Center, 1966.

F. Pfister, V. Chapurlat, M. Huchard, and C. Nebut, A Light-Weight Annotationn based solution to design Domain Specific Graphical Modeling Languages, ECMFA Demos and Posters, European Conference on Modelling Foundations and Applicaa tions, 2013.

F. Pfister, M. Huchard, and C. Nebut, A Framework for Concurrent Design of Me tamodels and Diagrams -Towards an Agile Method for the Synthesis of Domain Specific Graphical Modeling languages, ICEIS, International Conference on Enn terprise Information Systems, pp.298-306, 2014.

F. R. Pitts, A graph theoretic approach to historical geography. The Professional Geographer, pp.15-20, 1965.

J. Privat, A concise reference of the nit langage, 2011.

J. Puget, On the satisfiability of symmetrical constrained satisfaction problems, Methodologies for Intelligent Systems, pp.350-361, 1993.
DOI : 10.1007/3-540-56804-2_33

J. Puget, A c++ implementation of clp, 1994.

H. L. Rakotonirainy, J. Müller, and B. O. Ramamonjisoa, Towards a Generic Framework for the Initialization and the Observation of Socio-environmental Models, Model and Data Engineering, pp.45-52, 2014.
DOI : 10.1007/978-3-319-11587-0_6

J. Régin, A filtering algorithm for constraints of difference in csps, AAAI, Association for the Advancement of Artificial Intelligence, pp.362-367, 1994.

D. T. Ross, Structured Analysis (SA) : A Language for Communicating Ideas, IEEE Transactions on Software Engineering, issue.1, pp.16-34, 1977.
DOI : 10.1007/978-1-4612-6315-9_27

F. Rossi, P. Van-beek, and T. Walsh, Handbook of Constraint Programming, 2006.

M. Roy, S. Schmid, and G. Trédan, Modeling and measuring graph similarity, Proceedings of the 10th ACM international workshop on Foundations of mobile computing, FOMC '14, pp.47-52, 2014.
DOI : 10.1145/2634274.2634277
URL : https://hal.archives-ouvertes.fr/hal-01010901

J. Rumbaugh, M. Blaha, W. Premerlani, F. Eddy, W. Lorensen et al., Object-oriented Modeling and Design Unified Modeling Language Reference Manual, 1991.

H. Saada, M. Huchard, C. Nebut, and H. Sahraoui, Recovering Model Transformaa tion traces using Multi-Objective Optimization, ASE, IEEE/ACM International Conference on Automated Software Engineering, pp.688-693, 2013.

S. Sen, B. Baudry, and J. Mottu, On Combining Multi-formalism Knowledge to Select Models for Model Transformation Testing, 2008 International Conference on Software Testing, Verification, and Validation, pp.328-337, 2008.
DOI : 10.1109/ICST.2008.62
URL : https://hal.archives-ouvertes.fr/inria-00456955

S. Sen, B. Baudry, and J. Mottu, Automatic Model Generation Strategies for Model Transformation Testing, ICMT, International Conference on Model Transs formation, pp.148-164, 2009.
DOI : 10.1007/11768869_13
URL : https://hal.archives-ouvertes.fr/inria-00468256

H. Simonis, The CHIP system and its applications, CP, International Conference on Principles and Practice of Constraint Programming, pp.643-646, 1995.
DOI : 10.1007/3-540-60299-2_42

H. Simonis, Sudoku as a Constraint Problem, CP Workshop, on Modeling and Reformulating Constraint Satisfaction Problems, pp.13-27, 2005.

A. Singhal, Modern information retrieval : A brief overview, IEEE Data Engineering Bulletin, vol.24, issue.4, pp.35-43, 2001.

D. Steinberg, F. Budinsky, M. Paternostro, and E. Merks, EMF : Eclipse Modeling Framework 2.0, 2009.

N. Tamura, A. Taga, S. Kitagawa, and M. Banbara, Compiling finite linear CSP into SAT, Constraints, vol.64, issue.2, pp.254-272
DOI : 10.1007/s10601-008-9061-0

H. Tardieu, A. Rochfeld, R. Colletti, and . La, Principes et Outils. Les Editions d'Organisation, 1984.

J. Tolvanen, The Business Cases for Modeling and Gene rators. Code Generation Conference Aivalable at, 2014.

K. Voigt and T. Heinze, Metamodel Matching Based on Planar Graph Edit Distance, Theory and Practice of Model Transformations, pp.245-259, 2010.
DOI : 10.1007/978-3-642-13688-7_17

K. Voigt, Structural Graph-based Metamodel Matching, 2011.

M. Weller, A. Chateau, and R. Giroudeau, Exact approaches for scaffolding, BMC Bioinformatics, vol.16, issue.Suppl 14, pp.1471-2105, 2015.
DOI : 10.1186/1471-2105-16-S14-S2
URL : https://hal.archives-ouvertes.fr/lirmm-01219627

H. Wu, R. Monahan, and J. F. Power, Exploiting Attributed Type Graphs to Gene rate Metamodel Instances Using an SMT Solver, TASE, International Symposium on Theoretical Aspects of Software Engineering, pp.175-182, 2013.

K. Zhang and D. Shasha, Simple Fast Algorithms for the Editing Distance between Trees and Related Problems, SIAM Journal on Computing, vol.18, issue.6, pp.1245-1262, 1989.
DOI : 10.1137/0218082
URL : http://grantjenks.com/wiki/_media/ideas/simple_fast_algorithms_for_the_editing_distance_between_tree_and_related_problems.pdf