Ensuring Correctness of Model Transformations While Remaining Decidable

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.
Type de document :
Communication dans un congrès
Theoretical Aspects of Computing - ICTAC, Oct 2016, Taipei, Taiwan. pp.315 - 332, 2016, Theoretical Aspects of Computing – ICTAC 2016 13th International Colloquium, Taipei, Taiwan, ROC, October 24–31, 2016, Proceedings. 〈10.1007/978-3-319-46750-4_18〉
Liste complète des métadonnées

Littérature citée [25 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01403585
Contributeur : Martin Strecker <>
Soumis le : samedi 26 novembre 2016 - 16:56:34
Dernière modification le : vendredi 9 décembre 2016 - 09:08:11

Fichier

paper61-procversion.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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, 2016, Theoretical Aspects of Computing – ICTAC 2016 13th International Colloquium, Taipei, Taiwan, ROC, October 24–31, 2016, Proceedings. 〈10.1007/978-3-319-46750-4_18〉. 〈hal-01403585〉

Partager

Métriques

Consultations de
la notice

243

Téléchargements du document

162