Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application

Kühne, Thomas D.; Hamann, Heiko; Arifulina, Svetlana; Engels, Gregor

doi:10.1007/978-3-319-30668-1_18

Cited by 2 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The majority of existing approaches, e.g. [6,8,15,23], target model-to-model transformations, often referred to as exogenous transformations [25] since source and target models typically correspond to different meta-models. Such transformations are well-suited to capture vertical translations, which build the basis for model refinement and code generation, and horizontal translations, which are of specific importance in model-based integration and migration scenarios.…”

Section: Related Workmentioning

confidence: 99%

Automatic Inference of Rule-Based Specifications of Complex In-place Model Transformations

Kehrer

Alshanqiti

Heckel

2017

Theory and Practice of Model Transformation

View full text Add to dashboard Cite

Optimal support for continuous evolution in model-based software development requires tool environments to be customisable to domain-specific modelling languages. An important aspect is the set of change operations available to modify models. In-place model transformations are well-suited for that purpose. However, the specification of transformation rules requires a deep understanding of the language metamodel, limiting it to expert tool developers and language designers. This is at odds with the aim of domain-specific visual modelling environments, which should be customisable by domain experts. We follow a model transformation by-example approach to mitigate that problem: Users generate transformation rules by creating examples of transformations using standard visual editors as macro recorders. Our ambition is to stick entirely to the concrete visual notation domain experts are familiar with, using rule inference to generalise a set of transformation examples. In contrast to previous approaches to the same problem, our approach supports the inference of complex rule features such as negative application conditions, multi-object patterns and global invariants. We illustrate the functioning of our approach by the inference of a complex and widely used refactoring operation on UML class diagrams.

show abstract