Name
Title | ||
|---|---|---|
Automatically Searching for Metamodel Well-Formedness Rules in Examples and Counter-Examples. |
Abstract | ||
|---|---|---|
Current metamodeling formalisms support the definition of a metamodel with two views: classes and relations, that form the core of the metamodel, and well-formedness rules, that constraints the set of valid models. While a safe application of automatic operations on models requires a precise definition of the domain using the two views, most metamodels currently present in repositories have only the first one part. In this paper, we propose to start from valid and invalid model examples in order to automatically retrieve well-formedness rules in OCL using Genetic Programming. The approach is evaluated on metamodels for state machines and features diagrams. The experiments aim at demonstrating the feasibility of the approach and at illustrating some important design decisions that must be considered when using this technique. |
Year | Venue | Field |
|---|---|---|
2013 | Lecture Notes in Computer Science | Computer science,Well-formedness,Finite-state machine,Theoretical computer science,Genetic programming,Counterexample,Rotation formalisms in three dimensions,Metamodeling |
DocType | Volume | ISSN |
Conference | 8107 | 0302-9743 |
Citations | PageRank | References |
12 | 0.49 | 9 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Faunes | 1 | 29 | 1.83 |
| Juan José Cadavid | 2 | 30 | 3.90 |
| Benoit Baudry | 3 | 2000 | 118.08 |
| Houari A. Sahraoui | 4 | 729 | 59.67 |
| Benoît Combemale | 5 | 423 | 46.61 |