Analysing Graph Transformation Rules through OCL

Cabot, Jordi; Clarisó, Robert; Guerra, Esther; Lara, Juan de

doi:10.1007/978-3-540-69927-9_16

Cited by 15 publications

(16 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Current analysis techniques (especially for graph transformations [10,21,37,30]) were developed for standard operational rules aimed to in-place transformations, and not for declarative TGG rules aimed at M2M transformation. Although some of these techniques can be adapted to operational TGG rules, declarative TGG rules cannot be analysed with them.…”

Section: Related Workmentioning

confidence: 99%

Verification and validation of declarative model-to-model transformations through invariants

Cabot

Clarisó

Guerra

et al. 2010

Journal of Systems and Software

Self Cite

115

View full text Add to dashboard Cite

Esta es la versión de autor del artículo publicado en: This is an author produced version of a paper published in: AbstractIn this paper we propose a method to derive OCL invariants from declarative model-to-model transformations in order to enable their verification and analysis. For this purpose we have defined a number of invariant-based verification properties which provide increasing degrees of confidence about transformation correctness, such as whether a rule (or the whole transformation) is satisfiable by some model, executable or total. We also provide some heuristics for generating meaningful scenarios that can be used to semiautomatically validate the transformations. As a proof of concept, the method is instantiated for two prominent model-to-model transformation languages: Triple Graph Grammars and QVT.

show abstract

Section: Related Workmentioning

confidence: 99%

Verification and validation of declarative model-to-model transformations through invariants

Cabot

Clarisó

Guerra

et al. 2010

Journal of Systems and Software

Self Cite

115

View full text Add to dashboard Cite

show abstract

“…This paper extends our previous work in [15] by refining the translation patterns and extending them with a set of optimization and simplification rules, by adding validation capabilities to our framework, and by providing a complete tool support as described above. As part of our tool support we also discuss some heuristics that help to scale the analysis when dealing with large metamodels and rules.…”

Section: Send Offprint Requests Tomentioning

confidence: 82%

A UML/OCL framework for the analysis of graph transformation rules

et al. 2009

Self Cite

View full text Add to dashboard Cite

El acceso a la versión del editor puede requerir la suscripción del recurso Access to the published version may require subscription Abstract In this paper we present an approach for the analysis of graph transformation rules based on an intermediate OCL representation. We translate different rule semantics into OCL, together with the properties of interest (like rule applicability, conflicts or independence). The intermediate representation serves three purposes: (i) it allows the seamless integration of graph transformation rules with the MOF and OCL standards, and enables taking the meta-model and its OCL constraints (i.e. well-formedness rules) into account when verifying the correctness of the rules; (ii) it permits the interoperability of graph transformation concepts with a number of standards-based model-driven development tools; and (iii) it makes available a plethora of OCL tools to actually perform the rule analysis. This approach is especially useful to analyse the operational semantics of Domain Specific Visual Languages. We have automated these ideas by providing designers with tools for the graphical specification and analysis of graph transformation rules, including a backannotation mechanism that presents the analysis results in terms of the original language notation.

show abstract

“…In DPF terms, this means that VTMS can be seen as transforming the set of constraints C S2 while ignoring C S1 . An approach to the analysis of graph transformation rules based on an intermediate OCL representation is presented in [3]. The semantics of rules together with their properties (such as rule applicability, conflict or independence) are transformed into OCL expressions.…”

Section: Related Workmentioning

confidence: 99%

A Formalisation of Constraint-Aware Model Transformations

Rutle¹,

Rossini

Lamo³

et al. 2010

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. This paper introduces a formal approach to the definition of constraint-aware model transformations. The proposed approach is based on the Diagram Predicate Framework and extends graph transformations with the ability to handle constraints in the definition and execution of model transformations. In particular, it uses non-deleting rules that are typed over the metamodel of a joined modelling language which is constructed from the source and target languages. Furthermore, the application of transformation rules is formalised as a pushout construction that creates a model which is typed over the metamodel of the joined modelling language. Finally, the target model is obtained from the created model by a pullback construction.

show abstract

Analysing Graph Transformation Rules through OCL

Abstract: 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:

Cited by 15 publications

References 19 publications

Verification and validation of declarative model-to-model transformations through invariants

Verification and validation of declarative model-to-model transformations through invariants

A UML/OCL framework for the analysis of graph transformation rules

A Formalisation of Constraint-Aware Model Transformations

Contact Info

Product

Resources

About