DSLTrans: A turing incomplete transformation language

28Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Barroca, B., Lúcio, L., Amaral, V., Félix, R., & Sousa, V. (2011). DSLTrans: A turing incomplete transformation language. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6563 LNCS, pp. 296–305). https://doi.org/10.1007/978-3-642-19440-5_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free