Automated model merge by design space exploration

Csaba Debreceni, István Ráth, D. Varró, Xabier De Carlos, Xabier Mendialdua, Salvador Trujillo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

Industrial applications of model-driven engineering to develop large and complex systems resulted in an increasing demand for collaboration features. However, use cases such as model differencing and merging have turned out to be a difficult challenge, due to (i) the graph-like nature of models, and (ii) the complexity of certain operations (e.g. hierarchy refactoring) that are common today. In the paper, we present a novel search-based automated model merge approach where rule-based design space exploration is used to search the space of solution candidates that represent conflict-free merged models. Our method also allows engineers to easily incorporate domain-specific knowledge into the merge process to provide better solutions. The merge process automatically calculates multiple merge candidates to be presented to domain experts for final selection. Furthermore, we propose to adopt a generic synthetic benchmark to carry out an initial scalability assessment for model merge with large models and large change sets.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages104-121
Number of pages18
Volume9633
ISBN (Print)9783662496640
DOIs
Publication statusPublished - 2016
Event19th International Conference on Fundamental Approaches to Software Engineering, FASE 2016 Held as Part of European Joint Conferences on Theory and Practice of Software, ETAPS 2016 - Eindhoven, Netherlands
Duration: Apr 2 2016Apr 8 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9633
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other19th International Conference on Fundamental Approaches to Software Engineering, FASE 2016 Held as Part of European Joint Conferences on Theory and Practice of Software, ETAPS 2016
CountryNetherlands
CityEindhoven
Period4/2/164/8/16

Fingerprint

Design Space Exploration
Model
Refactoring
Industrial Application
Use Case
Merging
Industrial applications
Scalability
Large scale systems
Complex Systems
Benchmark
Engineering
Engineers
Calculate
Graph in graph theory

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Debreceni, C., Ráth, I., Varró, D., De Carlos, X., Mendialdua, X., & Trujillo, S. (2016). Automated model merge by design space exploration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9633, pp. 104-121). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9633). Springer Verlag. https://doi.org/10.1007/978-3-662-49665-7_7

Automated model merge by design space exploration. / Debreceni, Csaba; Ráth, István; Varró, D.; De Carlos, Xabier; Mendialdua, Xabier; Trujillo, Salvador.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9633 Springer Verlag, 2016. p. 104-121 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9633).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Debreceni, C, Ráth, I, Varró, D, De Carlos, X, Mendialdua, X & Trujillo, S 2016, Automated model merge by design space exploration. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 9633, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9633, Springer Verlag, pp. 104-121, 19th International Conference on Fundamental Approaches to Software Engineering, FASE 2016 Held as Part of European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, Netherlands, 4/2/16. https://doi.org/10.1007/978-3-662-49665-7_7
Debreceni C, Ráth I, Varró D, De Carlos X, Mendialdua X, Trujillo S. Automated model merge by design space exploration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9633. Springer Verlag. 2016. p. 104-121. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-662-49665-7_7
Debreceni, Csaba ; Ráth, István ; Varró, D. ; De Carlos, Xabier ; Mendialdua, Xabier ; Trujillo, Salvador. / Automated model merge by design space exploration. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9633 Springer Verlag, 2016. pp. 104-121 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{78ec54138abb40798e240cb4304a0d55,
title = "Automated model merge by design space exploration",
abstract = "Industrial applications of model-driven engineering to develop large and complex systems resulted in an increasing demand for collaboration features. However, use cases such as model differencing and merging have turned out to be a difficult challenge, due to (i) the graph-like nature of models, and (ii) the complexity of certain operations (e.g. hierarchy refactoring) that are common today. In the paper, we present a novel search-based automated model merge approach where rule-based design space exploration is used to search the space of solution candidates that represent conflict-free merged models. Our method also allows engineers to easily incorporate domain-specific knowledge into the merge process to provide better solutions. The merge process automatically calculates multiple merge candidates to be presented to domain experts for final selection. Furthermore, we propose to adopt a generic synthetic benchmark to carry out an initial scalability assessment for model merge with large models and large change sets.",
author = "Csaba Debreceni and Istv{\'a}n R{\'a}th and D. Varr{\'o} and {De Carlos}, Xabier and Xabier Mendialdua and Salvador Trujillo",
year = "2016",
doi = "10.1007/978-3-662-49665-7_7",
language = "English",
isbn = "9783662496640",
volume = "9633",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "104--121",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Automated model merge by design space exploration

AU - Debreceni, Csaba

AU - Ráth, István

AU - Varró, D.

AU - De Carlos, Xabier

AU - Mendialdua, Xabier

AU - Trujillo, Salvador

PY - 2016

Y1 - 2016

N2 - Industrial applications of model-driven engineering to develop large and complex systems resulted in an increasing demand for collaboration features. However, use cases such as model differencing and merging have turned out to be a difficult challenge, due to (i) the graph-like nature of models, and (ii) the complexity of certain operations (e.g. hierarchy refactoring) that are common today. In the paper, we present a novel search-based automated model merge approach where rule-based design space exploration is used to search the space of solution candidates that represent conflict-free merged models. Our method also allows engineers to easily incorporate domain-specific knowledge into the merge process to provide better solutions. The merge process automatically calculates multiple merge candidates to be presented to domain experts for final selection. Furthermore, we propose to adopt a generic synthetic benchmark to carry out an initial scalability assessment for model merge with large models and large change sets.

AB - Industrial applications of model-driven engineering to develop large and complex systems resulted in an increasing demand for collaboration features. However, use cases such as model differencing and merging have turned out to be a difficult challenge, due to (i) the graph-like nature of models, and (ii) the complexity of certain operations (e.g. hierarchy refactoring) that are common today. In the paper, we present a novel search-based automated model merge approach where rule-based design space exploration is used to search the space of solution candidates that represent conflict-free merged models. Our method also allows engineers to easily incorporate domain-specific knowledge into the merge process to provide better solutions. The merge process automatically calculates multiple merge candidates to be presented to domain experts for final selection. Furthermore, we propose to adopt a generic synthetic benchmark to carry out an initial scalability assessment for model merge with large models and large change sets.

UR - http://www.scopus.com/inward/record.url?scp=84961692435&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84961692435&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-49665-7_7

DO - 10.1007/978-3-662-49665-7_7

M3 - Conference contribution

AN - SCOPUS:84961692435

SN - 9783662496640

VL - 9633

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 104

EP - 121

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -