HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Ensuring Correctness of Model Transformations While Remaining Decidable

Jon Haël Brenas 1 Rachid Echahed 1 Martin Strecker 2, 3, 4
1 CAPP - Calculs algorithmes programmes et preuves
LIG - Laboratoire d'Informatique de Grenoble
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
4 MOSEL - Proof-oriented development of computer-based systems
LORIA - FM - Department of Formal Methods
Abstract : This paper is concerned with the interplay of the expressiveness of model and graph transformation languages, of assertion formalisms making correctness statements about transformations, and the decidability of the resulting verification problems. We put a particular focus on transformations arising in graph-based knowledge bases and model-driven engineering. We then identify requirements that should be satisfied by logics dedicated to reasoning about model transformations, and investigate two promising instances which are decidable fragments of first-order logic.
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

Contributor : Martin Strecker Connect in order to contact the contributor
Submitted on : Saturday, November 26, 2016 - 4:56:34 PM
Last modification on : Sunday, February 20, 2022 - 12:38:04 PM


Files produced by the author(s)



Jon Haël Brenas, Rachid Echahed, Martin Strecker. Ensuring Correctness of Model Transformations While Remaining Decidable. Theoretical Aspects of Computing - ICTAC, Oct 2016, Taipei, Taiwan. pp.315 - 332, ⟨10.1007/978-3-319-46750-4_18⟩. ⟨hal-01403585⟩



Record views


Files downloads