Termination of graph rewriting is undecidable
Fundamenta Informaticae
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Termination Criteria for DPO Transformations with Injective Matches
Electronic Notes in Theoretical Computer Science (ENTCS)
Precise Semantics of EMF Model Transformations by Graph Transformation
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
A Taxonomy of Model Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
A technique for automatic validation of model transformations
MODELS'10 Proceedings of the 13th international conference on Model driven engineering languages and systems: Part I
Termination criteria for model transformation
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Verification of Model Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
International Journal of Information Technology and Web Engineering
| Hi-index | 0.00 |
In this paper we present DSLTrans: a visual language and a tool for model transformations. We aim at tackling a couple of important challenges in model transformation languages -- transformation termination and confluence. The contribution of this paper is the proposition of a transformation language where all possible transformations are guaranteed to be terminating and confluent by construction. The resulting transformation language is simple, turing incomplete and includes transformation abstractions to support transformations in a software language engineering context. Our explanation of DSLTrans includes a complete formal description of our visual language and its properties.