Developing model transformations can be a complex task and as such advanced reuse mechanisms are increasingly recognised as necessary for increasing both development productivity and quality of model transformations. Creating a new transformation by chaining existing ones is one of the possible ways to reuse existing transformations. However, chaining transformations can be an error prone and strenuous task especially in case of multiple potential chains. In this paper the CITRIC tool is presented as a solution to mitigate the problem of characterizing the multitude of transformation chains that can be defined by composing existing model transformations to bridge source and target metamodels that are of interest for the modeler. The tool is based on well-established algorithms, and it is able to support modelers when multiple transformation chains are available. The optimal chain is automatically selected based on two quality criteria i.e., metamodel coverage and information loss. © 2018 Association for Computing Machinery.

A tool for automatically selecting optimal model transformation chains

Basciani Francesco;D'Emidio Mattia;Iovino Ludovico
2018-01-01

Abstract

Developing model transformations can be a complex task and as such advanced reuse mechanisms are increasingly recognised as necessary for increasing both development productivity and quality of model transformations. Creating a new transformation by chaining existing ones is one of the possible ways to reuse existing transformations. However, chaining transformations can be an error prone and strenuous task especially in case of multiple potential chains. In this paper the CITRIC tool is presented as a solution to mitigate the problem of characterizing the multitude of transformation chains that can be defined by composing existing model transformations to bridge source and target metamodels that are of interest for the modeler. The tool is based on well-established algorithms, and it is able to support modelers when multiple transformation chains are available. The optimal chain is automatically selected based on two quality criteria i.e., metamodel coverage and information loss. © 2018 Association for Computing Machinery.
2018
978-1-4503-5965-8
Graph algorithms; Model transformation composition; Model-driven engineering; Reuse of model transformations; Shortest paths
File in questo prodotto:
File Dimensione Formato  
2018_21ACM_IEEEIntConfModels_2_Basciani.pdf

non disponibili

Tipologia: Versione Editoriale (PDF)
Licenza: Non pubblico
Dimensione 2.64 MB
Formato Adobe PDF
2.64 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12571/6967
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 0
social impact