Formal validation of model transformation with Coq proof assistant

Model Driven Engineering (MDE) is general-purpose engineering methodology to elevate system design, maintenance, and analysis to corresponding activities on models. Models (graphical and/or textual) of a target application are automatically transformed into source code, performance models, Promela files (for model checking), and so on for system analysis and construction. Models are instances of metamodels. One form an MDE metamodel can take is a [class diagram, constraints] pair: the class diagram defines all object diagrams that could be metamodel instances; OCL constraints eliminate semantically undesirable instances. A metamodel refactoring is an invertible semantics-preserving co-transformation, i.e. it transforms both a metamodel and its models without losing data. This paper addresses a subproblem of metamodel refactoring: how to prove the correctness of refactorings of class diagrams without OCL constraints using the Coq Proof Assistant.

show abstract

A Contribution to the Specification of Model Transformations with Metamodel Matching Approach

Berramla

Deba

Benyamina

et al. 2017

International Journal of Information System Modeling and Design

Self Cite

View full text Add to dashboard Cite

Model-driven engineering (MDE) is a paradigm based on the intensive use of models throughout the life cycle of an application, where model transformation plays an important role. Various model transformation approaches have been proposed, but developers are still faced with the complexity of model transformation specifications. Most of these approaches are based on the specification of transformation rules with a concrete syntax at a low level where the developer must master the transformation language. The question at this level is how to generate a model transformation specification that must be at a very abstract level, independent of any transformation language. This article aims to propose an approach to generate an abstract representation of transformation rules and these are used to produce a source code written in a chosen transformation language. The transformation rules are calculated semi-automatically by using a matching technique on elements of source and target metamodels. This idea is illustrated by different transformation examples.

show abstract

Formal validation of model transformation with Coq proof assistant

Cited by 3 publications

References 12 publications

A Semantic Framework to Improve Model-to-Model Transformations

A Semantic Framework to Improve Model-to-Model Transformations

On Proving the Correctness of Refactoring Class Diagrams of MDE Metamodels

A Contribution to the Specification of Model Transformations with Metamodel Matching Approach

Contact Info

Product

Resources

About