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
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
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.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01403585
Contributor : Martin Strecker <>
Submitted on : Saturday, November 26, 2016 - 4:56:34 PM
Last modification on : Monday, April 20, 2020 - 11:16:02 AM

File

paper61-procversion.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

541

Files downloads

640