A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit <a rel="external noopener" href="https://lra.le.ac.uk/bitstream/2381/42197/2/paper.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Automatic Inference of Rule-Based Specifications of Complex In-place Model Transformations
[chapter]
<span title="">2017</span>
<i title="Springer International Publishing">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a>
</i>
Preserved Fulltext
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
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-61473-1_7">doi:10.1007/978-3-319-61473-1_7</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/a2rjyxo2q5fjtaoxznintfmece">fatcat:a2rjyxo2q5fjtaoxznintfmece</a>
</span>
more »
... he 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.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721063048/https://lra.le.ac.uk/bitstream/2381/42197/2/paper.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/ed/fb/edfb4e5db0d686f206324a43adac5806b23fd5ac.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-61473-1_7">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>