Evaluation of Kermeta on Graph Transformation Problems - Archive ouverte HAL Access content directly
Journal Articles International Journal on Software Tools for Technology Transfer Year : 2010

Evaluation of Kermeta on Graph Transformation Problems

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

Abstract

Kermeta is a meta-language for specifying the structure and behavior of graphs of interconnected objects called models. In this paper, we show that Kermeta is relatively suitable for solving three graph-based problems. First, Kermeta allows the specification of generic model transformations such as refactorings that we apply to different metamodels including Ecore, Java, and Uml. Second, we demonstrate the extensibility of Kermeta to the formal language Alloy using an inter-language model transformation. Kermeta uses Alloy to generate recommendations for completing partially specified models. Third, we show that the Kermeta compiler achieves better execution time and memory performance compared to similar graph-based approaches using a common case study. The three solutions proposed for those graph-based problems and their evaluation with Kermeta according to the criteria of genericity, extensibility, and performance are the main contribution of the paper. Another contribution is the comparison of these solutions with those proposed by other graph-based tools.
Fichier principal
Vignette du fichier
Moha10b.pdf (662.49 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00477521 , version 1 (29-04-2010)

Identifiers

  • HAL Id : inria-00477521 , version 1

Cite

Naouel Moha, Sagar Sen, Cyril Faucher, Olivier Barais, Jean-Marc Jézéquel. Evaluation of Kermeta on Graph Transformation Problems. International Journal on Software Tools for Technology Transfer, 2010. ⟨inria-00477521⟩
213 View
185 Download

Share

Gmail Facebook Twitter LinkedIn More