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

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

doi:10.1007/s10270-009-0129-0

Cited by 17 publications

(19 citation statements)

References 43 publications

(72 reference statements)

Supporting

Mentioning

Contrasting

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%

“…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%

See 1 more Smart Citation

Formal validation of domain-specific languages with derived features and well-formedness constraints

et al. 2015

View full text Add to dashboard Cite

Despite the wide range of existing tool support, constructing a design environment for a complex domain-specific language (DSL) is still a tedious task as the large number of derived features and well-formedness constraints complementing the domain metamodel necessitate special handling. Such derived features and constraints are frequently defined by declarative techniques (such graph patterns or OCL invariants).However, for complex domains, derived features and constraints can easily be formalized incorrectly resulting in inconsistent, incomplete or ambiguous DSL specifications. To detect such issues, we propose an automated mapping of EMF metamodels enriched with derived features and well-formedness constraints captured as graph queries in EMF-IncQuery or (a subset of) OCL invariants into an effectively propositional fragment of first-order logic which can be efficiently analyzed by back-end reasoners.On the conceptual level, the main added value of our encoding is (1) to transform graph patterns of the EMF-IncQuery framework into FOL and (2) to introduce approximations for complex language features (e.g. transitive closure or multiplicities) which are not expressible in FOL. On the practical level, we identify and address relevant challenges and scenarios for systematically validating DSL specifications. Our approach is supported by a tool and it will be illustrated on analyzing a DSL in the avionics domain. We also present initial performance experiments for the validation using Z3 and Alloy as back-end reasoners.

show abstract

Section: Validation Of Ocl Enriched Metamodelsmentioning

confidence: 99%

Section: Validation Of Ocl Enriched Metamodelsmentioning

confidence: 99%

Formal validation of domain-specific languages with derived features and well-formedness constraints

et al. 2015

View full text Add to dashboard Cite

show abstract

“…, 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%

Using UML for Modeling Procedural Legal Rules: Approach and a Study of Luxembourg’s Tax Law

Soltana

Fourneret

Adedjouma

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Many laws, e.g., those concerning taxes and social benefits, need to be operationalized and implemented into public administration procedures and eGovernment applications. Where such operationalization is warranted, the legal frameworks that interpret the underlying laws are typically prescriptive, providing procedural rules for ensuring legal compliance. We propose a UML-based approach for modeling procedural legal rules. With help from legal experts, we investigate actual legal texts, identifying both the information needs and sources of complexity in the formalization of procedural legal rules. Building on this study, we develop a UML profile that enables more precise modeling of such legal rules. To be able to use logic-based tools for compliance analysis, we automatically transform models of procedural legal rules into the Object Constraint Language (OCL). We report on an application of our approach to Luxembourg's Income Tax Law providing initial evidence for the feasibility and usefulness of our approach.

show abstract

“…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%

A Satisficing Bi-Directional Model Transformation Engine using Mixed Integer Linear Programming.

Callow¹,

Kalawsky²

2013

JOT

View full text Add to dashboard Cite

The use of model transformation in software engineering has increased significantly during the past decade, with the ability to rapidly transform models and ensure consistency between those models being a key property of Model Driven Architecture. However, these approaches can be applied to a wide variety of different model types and some of these models and associated transformations require different semantics than those popularised by current model transformation tools. Specifically, current relational model transformation languages typically prioritise matching relation patterns in the source model over creating a target model that is compliant with its meta-model. In this paper we describe a relational model transformation engine implemented as a series of Mixed Integer Linear Programs (MILP). This engine has a key novel feature; it prioritises target model compliance with its meta-model by considering multiple interpretations of applying the transformation specification in order to ensure a correct target model is generated. In this paper the MILP transformation engine and the representations it uses are described, followed by the results of applying it to examples of varying complexity.

show abstract

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

Cited by 17 publications

References 43 publications

Formal validation of domain-specific languages with derived features and well-formedness constraints

Formal validation of domain-specific languages with derived features and well-formedness constraints

Using UML for Modeling Procedural Legal Rules: Approach and a Study of Luxembourg’s Tax Law

A Satisficing Bi-Directional Model Transformation Engine using Mixed Integer Linear Programming.

Contact Info

Product

Resources

About