up: Publications |
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.
Online Copy |
BibTeX Entry |
@inproceedings{brenas16:_ensur_correc_model_trans_while_remain_decid, author = {Jon Ha{\"{e}}l Brenas and Rachid Echahed and Martin Strecker}, title = {Ensuring Correctness of Model Transformations While Remaining Decidable}, booktitle = {Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings}, editor = {Augusto Sampaio and Farn Wang}, pages = {315--332}, year = 2016, series = {Lecture Notes in Computer Science}, volume = {9965}, url = {http://dx.doi.org/10.1007/978-3-319-46750-4_18}, doi = {10.1007/978-3-319-46750-4_18}, }
Tue Oct 25 11:40:23 CEST 2016 |