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

Abstract

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.

Method for Adaptive Semantic Testing of Educational Materials Level of Knowledge

“…The method creates new test tasks using production rules [18] and does not require additional formalization of educational materials. Each production rule consists of an antecedent and a consequence [2,12,14,20]. The antecedent is some fragmenttemplate, which is searched; and the consequence -the algorithm for converting a content fragment into the content of the components of the test task, which are performed under the condition of a successful search result (Fig.…”

Inferring visual contracts from Java programs

“…It does not rely on extraction of contract instances from Java executions, but works on a small, manually produced set of model transformation examples, including negative ones where no transformation should take place. As a consequence, in [27] we have explored alternative solutions to inferring simple attribute conditions, but also addressed the inference of negative application conditions.…”

Graph Attribution Through Sub-Graphs

“…In related work of another type, an idea very similar to the one worked out in this paper has been used in [9] to extend a technique that was only available for graphs without attributes. This supports the point, made in the introduction, that there is a benefit to stick to the framework of graphs to encode the world of algebras.…”