Triple Graph Grammars for Multi-version Models
Matthias Barkowsky, Holger Giese

TL;DR
This paper introduces a novel approach using triple graph grammars to efficiently manage and transform multiple versions of models in model-driven software engineering, improving execution time and handling inconsistencies.
Contribution
It extends triple graph grammars to support multi-version models, enabling compact representation and efficient transformation of multiple model versions.
Findings
Correctness with respect to standard semantics established
Empirical evaluation shows improved execution time
Potential for better analysis performance
Abstract
Like conventional software projects, projects in model-driven software engineering require adequate management of multiple versions of development artifacts, importantly allowing living with temporary inconsistencies. In the case of model-driven software engineering, employed versioning approaches also have to handle situations where different artifacts, that is, different models, are linked via automatic model transformations. In this report, we propose a technique for jointly handling the transformation of multiple versions of a source model into corresponding versions of a target model, which enables the use of a more compact representation that may afford improved execution time of both the transformation and further analysis operations. Our approach is based on the well-known formalism of triple graph grammars and a previously introduced encoding of model version histories called…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel-Driven Software Engineering Techniques · Software System Performance and Reliability · Advanced Software Engineering Methodologies
