DSLTrans: A Turing Incomplete Transformation Language

  • Bruno Barroca
  • Levi Lúcio
  • Vasco Amaral
  • Roberto Félix
  • Vasco Sousa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6563)

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.

Keywords

Model Transformations Turing Incompleteness Termination Confluence 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Biermann, E., Ermel, C., Taentzer, G.: Precise Semantics of EMF Model Transformations by Graph Transformation. In: Busch, C., Ober, I., Bruel, J.-M., Uhl, A., Völter, M. (eds.) MODELS 2008. LNCS, vol. 5301, pp. 53–67. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  2. 2.
    Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Springer, Heidelberg (2006)MATHGoogle Scholar
  3. 3.
    Ehrig, H., Ehrig, K., de Lara, J., Taentzer, G., Varró, D., Varró-Gyapay, S.: Termination criteria for model transformation. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 49–63. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Levendovszky, T., Prange, U., Ehrig, H.: Termination criteria for dpo transformations with injective matches. Electronic Notes in Theoretical Computer Science 175(4), 87–100 (2007)CrossRefMATHGoogle Scholar
  5. 5.
    Lúcio, L., Barroca, B., Amaral, V.: A technique for automatic validation of model transformations. In: Petriu, D.C., Rouquette, N., Haugen, Ø. (eds.) MODELS 2010. LNCS, vol. 6394, pp. 136–150. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  6. 6.
    Mens, T., Van Gorp, P.: A taxonomy of model transformation. Electronic Notes in Theoretic Computer Science 152, 125–142 (2006)CrossRefGoogle Scholar
  7. 7.
    Plumpf, D.: Termination of graph rewriting is undecidable. Fundamenta Informaticae 33(2), 201–209 (1998)MathSciNetGoogle Scholar
  8. 8.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Bruno Barroca
    • 1
  • Levi Lúcio
    • 2
  • Vasco Amaral
    • 1
  • Roberto Félix
    • 1
  • Vasco Sousa
    • 1
  1. 1.CITI, Departamento de Informática, Faculdade de Ciencias e TecnologiaUniversidade Nova de LisboaPortugal
  2. 2.LASSYUniversity of LuxembourgLuxembourg

Personalised recommendations