Translating ATL Model Transformations to Algebraic Graph Transformations

Richa, Elie; Borde, Étienne; Pautet, Laurent

doi:10.1007/978-3-319-21155-8_14

Cited by 6 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another work which translates ATL transformations for analysis purposes is presented in [41]. The authors argue that an algebraic graph transformation representation would allow for enhanced verification tasks.…”

Section: Model Transformation Verificationmentioning

confidence: 99%

Full contract verification for ATL using symbolic execution

et al. 2016

View full text Add to dashboard Cite

The Atlas Transformation Language (ATL) is currently one of the most-used model transformation languages and has become a de-facto standard in modeldriven engineering for implementing model transformations. At the same time, it is understood by the community that enhancing methods for exhaustively verifying such transformations allows for a more widespread adoption of model-driven engineering in industry. A variety of proposals for the verification of ATL transformations have arisen in the past few years. However, the majority of these techniques are either based on nonexhaustive testing or on proof methods that require human assistance and/or are not complete.In this paper, we describe our method for statically verifying the declarative subset of ATL model transformations. This verification is performed by translating the transformation (including features like filters, OCL expressions, and lazy rules) into our model transformation language DSLTrans. As we handle only the declarative portion of ATL, and DSLTrans is Turingincomplete, this reduction in expressivity allows us to use a symbolic-execution approach to generate representations of all possible input models to the transform-

show abstract

Section: Model Transformation Verificationmentioning

confidence: 99%

Full contract verification for ATL using symbolic execution

et al. 2016

View full text Add to dashboard Cite

show abstract

RuleMerger: Automatic Construction of Variability-Based Model Transformation Rules

Strüber

Rubin

Arendt

et al. 2016

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Variability-based model transformation: formal foundation and application

et al. 2018

View full text Add to dashboard Cite

Model transformation systems often contain transformation rules that are substantially similar to each other, causing maintenance issues and performance bottlenecks. To address these issues, we introduce variability-based model transformation . The key idea is to encode a set of similar rules into a compact representation, called variability-based rule . We provide an algorithm for applying such rules in an efficient manner. In addition, we introduce rule merging, a three-component mechanism for enabling the automatic creation of variability-based rules. Our rule application and merging mechanisms are supported by a novel formal framework, using category theory to provide precise definitions and to prove correctness. In two realistic application scenarios, the created variability-based rules enabled considerable speedups, while also allowing the overall specifications to become more compact.

show abstract

Translating ATL Model Transformations to Algebraic Graph Transformations

Cited by 6 publications

References 11 publications

Full contract verification for ATL using symbolic execution

Full contract verification for ATL using symbolic execution

RuleMerger: Automatic Construction of Variability-Based Model Transformation Rules

Variability-based model transformation: formal foundation and application

Contact Info

Product

Resources

About