2009
DOI: 10.1007/s10270-009-0129-0
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 grap… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2010
2010
2015
2015

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 18 publications
(19 citation statements)
references
References 43 publications
(72 reference statements)
0
19
0
Order By: Relevance
“…An inverse approach is taken in [16] to formalize graph transformation rules by OCL constraints as an intermediate language and carry out verification of transformations in UML-to-CSP tool. These approaches mainly focus on mapping core graph transformation semantics, but does not cover many rich query features of the EMFIncQuery language (such as transitive closure and recursive pattern calls).…”
Section: Validation Of Ocl Enriched Metamodelsmentioning
confidence: 99%
See 1 more Smart Citation
“…An inverse approach is taken in [16] to formalize graph transformation rules by OCL constraints as an intermediate language and carry out verification of transformations in UML-to-CSP tool. These approaches mainly focus on mapping core graph transformation semantics, but does not cover many rich query features of the EMFIncQuery language (such as transitive closure and recursive pattern calls).…”
Section: Validation Of Ocl Enriched Metamodelsmentioning
confidence: 99%
“…These approaches mainly focus on mapping core graph transformation semantics, but does not cover many rich query features of the EMFIncQuery language (such as transitive closure and recursive pattern calls). Many ideas are shared with approaches aiming to verify model transformations [16,38,14], as they built upon the semantics of source and target languages to prove or refute properties of the model transformation. However, the validation tasks identified in the paper are different from the verification challenges of model transformations.…”
Section: Validation Of Ocl Enriched Metamodelsmentioning
confidence: 99%
“…, input n be the non-declared inputs required by P . 6 foreach input i do 7 result result+ADToOCL(AD, input i ) 8 end foreach 9 if (element is not a DecisionNode) then 10 Let st 1 , st 2 respectively be the opening and closing OCL fragments obtained from applying P . let maximal distance:DistanceUnit = 10.…”
Section: Transforming Legal Rules Into Oclmentioning
confidence: 99%
“…Model-to-OCL transformation. Cabot et al [6] construct OCL transformations of domain-specific language rules, and Milanović et al [20] derive OCL constraints from integrity rule models. These approaches neither address legal rules nor tackle the transformation of activity diagrams, as done in our approach.…”
Section: Related Workmentioning
confidence: 99%
“…Whilst these approaches are undeniably important, they don't directly address the issues we have highlighted; namely that relational model transformations can have ambiguous interpretations, and that this ambiguity can actually be desirable by allowing an engine to choose the best matches based on the supplied models. Because of this, applying the work of Cabot et al in verifying and validating graph transformations by generating an OCL based representation [CCG10] is more problematic because it makes implicit assumptions on the semantics of how a graph transformation will be applied. Whilst highly relevant and aiming for many of the same goals (e.g.…”
Section: Introductionmentioning
confidence: 99%