2011
DOI: 10.1007/978-3-642-19829-8_8
|View full text |Cite
|
Sign up to set email alerts
|

A Type-Theoretic Framework for Certified Model Transformations

Abstract: We present a framework based on the Calculus of Inductive Constructions (CIC) and its associated tool the Coq proof assistant to allow certification of model transformations in the context of Model-Driven Engineering (MDE). The approached is based on a semi-automatic translation process from metamodels, models and transformations of the MDE technical space into types, propositions and functions of the CIC technical space. We describe this translation and illustrate its use in a standard case study.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(27 citation statements)
references
References 11 publications
0
27
0
Order By: Relevance
“…Calegari et al use the Coq proof assistant to interactively verify that an ATL specification is able to produce target models that satisfy the given contracts [6]. Inspired by the proof-as-program methodology, further research develops the concept of proof-as-model-transformation methodology [10,14].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Calegari et al use the Coq proof assistant to interactively verify that an ATL specification is able to produce target models that satisfy the given contracts [6]. Inspired by the proof-as-program methodology, further research develops the concept of proof-as-model-transformation methodology [10,14].…”
Section: Related Workmentioning
confidence: 99%
“…The contracts are usually expressed in OCL for its declarative and logical nature. Many approaches have been adopted to verify the correctness of an ATL transformation [5,6,8,15]. These approaches usually consist of encoding the execution semantics of an ATL specification in a formal language.…”
Section: Introductionmentioning
confidence: 99%
“…Other related work is [9], which uses a verification model based on rewriting logic to analyse QVT-like transformations, and [16], which maps ATL into a verification model based on the Coq theorem prover. Alloy has been used to analyse UML and OCL specifications and model transformations in QVT [3,2].…”
Section: Related Workmentioning
confidence: 99%
“…At least two different logics are becoming popular: the Calculus of Inductive Constructions, inspired from typed lambda calculi, at the basis of Coq [13], and the Constructive Type Theory at the foundation of NuPrl [33]. These formalisms have been used in the context of Mde to extract certified transformations: Calegari et al [25] used Coq for handling Atl transformations, whereas Poernomo [91,92] used directly NuPrl to formalise Mof. Unfortunately, both contributions are only demonstrated on the famous Class Diagram to Relational Databases classical example.…”
Section: Type I: Transformation-independent and Input-independentmentioning
confidence: 99%