Benchmarking bidirectional transformations: theory, implementation, application, and assessment

Anjorin, Anthony; Buchmann, Thomas; Westfechtel, Bernhard; Diskin, Zinovy; Ko, Hsiang−Shang; Eramo, Romina; Hinkel, Georg; Samimi-Dehkordi, Leila; Zündorf, Albert

doi:10.1007/s10270-019-00752-x

Cited by 22 publications

(27 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let us now assume that source code (in Java) is generated from the class diagram. Figure 5 shows a simplified version of code generated for the class Vertex, including fields, get and set methods with generated bodies, 1 and a method for the shortest path with an empty body, to be supplied by the user. A "real" code generator would generate more sophisticated code, but the details of code generation are not important here.…”

Section: Motivationmentioning

confidence: 99%

“…The transition to application engineering is performed by filtering domain models at all levels of abstraction. Altogether, this development process renders the single-variant transformation (4) in the commuting diagram obsoleterather than the multi-variant transformation (1). Still, the single-variant transformation may be needed later when changes are performed in application engineering.…”

Section: Correctnessmentioning

confidence: 99%

See 1 more Smart Citation

Extending single- to multi-variant model transformations by trace-based propagation of variability annotations

Westfechtel

Greiner

2020

Softw Syst Model

Self Cite

View full text Add to dashboard Cite

Model-driven engineering involves the construction of models on different levels of abstraction. Software engineers are supported by model transformations, which automate the transition from high-to low-level models. Product line engineering denotes a systematic process that aims at developing different product variants from a set of reusable assets. When modeldriven engineering is combined with product line engineering, engineers have to deal with multi-variant models. In annotative approaches to product line engineering, model elements are decorated with annotations, i.e., Boolean expressions that define the product variants in which model elements are to be included. In model-driven product line engineering, domain engineers require multi-variant transformations, which create multi-variant target models from multi-variant source models. We propose a reuse-based gray-box approach to realizing multi-variant model transformations. We assume that single-variant transformations already exist, which have been developed for model-driven engineering, without considering product lines. Furthermore, we assume that single-variant transformations create traces, which comprise the steps executed in order to derive target models from source models. Single-variant transformations are extended into multi-variant transformations by trace-based propagation: after executing a single-variant transformation, the resulting single-variant target model is enriched with annotations that are calculated with the help of the transformation's trace. This approach may be applied to single-variant transformations written in different languages and requires only access to the trace, not to the respective transformation definition. We also provide a correctness criterion for trace-based propagation, and a proof that this criterion is satisfied under the prerequisites of a formal computational model.

show abstract

Section: Motivationmentioning

confidence: 99%

Section: Correctnessmentioning

confidence: 99%

Extending single- to multi-variant model transformations by trace-based propagation of variability annotations

Westfechtel

Greiner

2020

Softw Syst Model

Self Cite

View full text Add to dashboard Cite

show abstract

“…Restoration A comprehensive survey about model repair approaches is found in [28], whereas [2] is a recent survey about BX based approaches. Insights from these surveys show that there are basically three categories of consistency restoration approaches: programming based (PBR) approaches where consistency and its restoration is explicitly defined simultaneously, solver based (SBR) approaches where consistency is abstractly posed as logic formula and restoration is implemented using a solver or search-based algorithm, and finally, grammar based (GBR) approaches such as TGGs [19], which place themselves somewhere in between.…”

Section: State Of the Artmentioning

confidence: 99%

“…Model Synchronization represents a means to maintain global consistency of inter-related models by combining consistency verification with (semi-)automatic consistency restoration. The cross-disciplinary research field Bidirectional Transformations (BX) [8] investigates such means within different communities and it provides a number of theoretical and practical results (see [2] for a recent survey). However, the majority of these approaches is limited to a binary setting, i.e.…”

Section: Introductionmentioning

confidence: 99%

Towards Multiple Model Synchronization with Comprehensive Systems

Stünkel

König

Lamo

et al. 2020

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Model management is a central activity in Software Engineering. The most challenging aspect of model management is to keep models consistent with each other while they evolve. As a consequence, there has been increasing activity in this area, which has produced a number of approaches to address this synchronization challenge. The majority of these approaches, however, is limited to a binary setting; i.e. the synchronization of exactly two models with each other. A recent Dagstuhl seminar on multidirectional transformations made it clear that there is a need for further investigations in the domain of general multiple model synchronization simply because not every multiary consistency relation can be factored into binary ones. However, with the help of an auxiliary artifact, which provides a global view over all models, multiary synchronization can be achieved by existing binary model synchronization means. In this paper, we propose a novel comprehensive system construction to produce such an artifact using the same underlying base modelling language as the one used to define the models. Our approach is based on the definition of partial commonalities among a set of aligned models. Comprehensive systems can be shown to generalize the underlying categories of graph diagrams and triple graph grammars and can efficiently be implemented in existing tools.

show abstract

“…There are also purely constraint-based approaches [11,14,21] that encode both model structure and consistency relation into constraints and can easily handle schema compliance. This comes at a price, however, as the underlying constraint solvers do not scale with model-size and cannot compete with other approaches [1]. Our hybrid TGG/ILP approach is a compromise that leverages the flexibility of constraint solvers but still scales reasonably well [24] as the variables of the ILP problem are matches and not model elements.…”

Section: Related Workmentioning

confidence: 99%

Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming

Weidmann

Anjorin

2020

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

Triple Graph Grammars (TGGs) are a declarative and rulebased approach to bidirectional model transformation. The key feature of TGGs is the automatic derivation of various operations such as unidirectional transformation, model synchronisation, and consistency checking. Application conditions can be used to increase the expressiveness of TGGs by guaranteeing schema compliance, i.e., that domain constraints are respected by the TGG. In recent years, a series of new TGG-based operations has been introduced leveraging Integer Linear Programming (ILP) solvers to flexible consistency maintenance even in cases where no strict solution exists. Schema compliance is not guaranteed, however, as application conditions from the original TGG cannot be directly transferred to these ILP-based operations. In this paper, we extend ILP-based TGG operations so as to guarantee schema compliance. We implement and evaluate the practical feasibility of our approach.

show abstract

Benchmarking bidirectional transformations: theory, implementation, application, and assessment

Cited by 22 publications

References 28 publications

Extending single- to multi-variant model transformations by trace-based propagation of variability annotations

Extending single- to multi-variant model transformations by trace-based propagation of variability annotations

Towards Multiple Model Synchronization with Comprehensive Systems

Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming

Contact Info

Product

Resources

About