Termination Criteria for Model Transformation

Ehrig, Hartmut; Ehrig, Karsten; Lara, Juan de; Taentzer, Gabriele; Varró, Dániel; Varró–Gyapay, Szilvia

doi:10.1007/978-3-540-31984-9_5

Cited by 77 publications

(67 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Another group of works (see, e.g., [20][21][22][23][24]) also use a white-box approach to model-transformation specification and testing, aiming at fully validating the behaviour of the transformation (including other properties such as confluence of the rules, termination, etc.) using formal methods and their associated toolkitswhich include, e.g., Alloy, Maude, or graph rewriting techniques.…”

Section: Related Workmentioning

confidence: 99%

Typing Model Transformations Using Tracts

Vallecillo

Gogolla

2012

Theory and Practice of Model Transformations

View full text Add to dashboard Cite

Abstract. As the complexity of MDE artefacts grows, there is an increasing need to rely on precise and abstract mechanisms that allow system architects to reason about the systems they design, and to test their individual components. In particular, assigning types to models and model transformations is needed for realizing many key MDE activities. This paper presents a light-weight approach to type model transformations using tracts. Advantages and limitations of the proposal are discussed, as well as the applicability of the proposal in several settings.

show abstract

Section: Related Workmentioning

confidence: 99%

Typing Model Transformations Using Tracts

Vallecillo

Gogolla

2012

Theory and Practice of Model Transformations

View full text Add to dashboard Cite

show abstract

“…Other group of works (see, e.g., [5,6,7,8,10,11]) also use a white-box approach to model-transformation testing, aiming at fully validating the behaviour of the transformation (including other properties such as confluence of the rules, termination, etc.) using formal methods and their associated toolkits-which include, e.g., Alloy, Maude, or graph rewriting techniques.…”

Section: Related Workmentioning

confidence: 99%

“…In the first place we have the works that aim at fully validating the behaviour of the transformation and its associated properties (confluence of the rules, termination, etc.) using formal methods and their associated toolkits (see, e.g., [5,6,7,8,9,10,11]). The potential limitations with these proposals lies in their inherent computational complexity, which makes them inappropriate for fully testing large and complex model transformations.…”

Section: Introductionmentioning

confidence: 99%

Tractable Model Transformation Testing

Gogolla

Vallecillo

2011

Modelling Foundations and Applications

View full text Add to dashboard Cite

Abstract. Model transformation (MT) testing is gaining interest as the size and complexity of MTs grows. In general it is very difficult and expensive (time and computational complexity-wise) to validate in full the correctness of a MT. This paper presents a MT testing approach based on the concept of Tract, which is a generalization of the concept of Model Transformation Contract. A Tract defines a set of constraints on the source and target metamodels, a set of source-target constraints, and a tract test suite, i.e., a collection of source models satisfying the source constraints. We automatically generate input test suite models, which are then transformed into output models by the transformation under test, and the results checked with the USE tool (UML-based Specification Environment) against the constraints defined for the transformation. We show the different kinds of tests that can be conducted over a MT using this automated process, and the kinds of problems it can help uncovering.

show abstract

“…In some related work (e.g., [6,4]) termination is ensured by just the termination NAC L r → Q. This NAC is enough to ensure finite termination if the set of possible matches of the given rule does not change after applying the transformation rules, i.e.…”

Section: Definition 6 (Forward Transformation Rules For Patterns) Tomentioning

confidence: 99%

Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation

Orejas

Guerra

Lara

et al. 2009

Algebra and Coalgebra in Computer Science

Self Cite

View full text Add to dashboard Cite

Esta es la versión de autor de la comunicación de congreso publicada en: This is an author produced version of a paper published in: Abstract. Model-to-model (M2M) transformation consists in transforming models from a source to a target language. Many transformation languages exist, but few of them combine a declarative and relational style with a formal underpinning able to show properties of the transformation. Pattern-based transformation is an algebraic, bidirectional, and relational approach to M2M transformation. Specifications are made of patterns stating the allowed or forbidden relations between source and target models, and then compiled into low level operational mechanisms to perform source-to-target or target-to-source transformations. In this paper, we study the compilation into operational triple graph grammar rules and show: (i) correctness of the compilation of a specification without negative patterns; (ii) termination of the rules, and (iii) completeness, in the sense that every model considered relevant can be built by the rules.

show abstract

Termination Criteria for Model Transformation

Cited by 77 publications

References 21 publications

Typing Model Transformations Using Tracts

Typing Model Transformations Using Tracts

Tractable Model Transformation Testing

Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation

Contact Info

Product

Resources

About