Automatically Searching for Metamodel Well-Formedness Rules in Examples and Counter-Examples - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Automatically Searching for Metamodel Well-Formedness Rules in Examples and Counter-Examples

(1) , (2) , (2) , (1) , (2)
1
2

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. \end{abstract}
Fichier principal
Vignette du fichier
DerivingOCLInv_main.pdf (425.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00923789 , version 1 (04-01-2014)

Identifiers

  • HAL Id : hal-00923789 , version 1

Cite

Martin Faunes, Juan Cadavid, Benoit Baudry, Houari Sahraoui, Benoit Combemale. Automatically Searching for Metamodel Well-Formedness Rules in Examples and Counter-Examples. MODELS - ACM/IEEE 16th International Conference on Model Driven Engineering Languages and Systems, 2013, Miami, United States. pp.187-202. ⟨hal-00923789⟩
419 View
334 Download

Share

Gmail Facebook Twitter LinkedIn More