ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Science of Computer Programming
Volume 68, Issue 3, 1 October 2007, Pages 138-154
Special Issue on Model Transformation
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (586 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
doi:10.1016/j.scico.2007.05.006    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

Rule-based modularization in model transformation languages illustrated with ATL

Ivan Kurteva, Corresponding Author Contact Information, E-mail The Corresponding Author, Klaas van den Berga, E-mail The Corresponding Author and Frédéric Jouaultb, c, E-mail The Corresponding Author

aSoftware Engineering Group, University of Twente, The Netherlands bATLAS Group, INRIA and LINA, University of Nantes, France cDepartment of Computer and Information Sciences, University of Alabama at Birmingham, Birmingham, AL 35294-1170, United States

Received 12 August 2006; 
revised 20 April 2007; 
accepted 14 May 2007. 
Available online 16 July 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

This paper studies ways for modularizing transformation definitions in current rule-based model transformation languages. Two scenarios are shown in which the modular units are identified on the basis of relations between source and target metamodels and on the base of generic transformation functionality. Both scenarios justify modularization by requiring adaptability and reusability in transformation definitions. To enable representation and composition of the identified units, a transformation language must provide proper modular constructs and mechanisms for their integration. We evaluate several implementations of the scenarios by applying different transformation techniques: usage of explicit and implicit rule calls, and usage of rule inheritance. ATLAS Transformation Language (ATL) is used to illustrate these implementations. The experience with these scenarios shows that current languages provide a reasonably full set of modular constructs but may have problems in handling some composition tasks.

Keywords: Model transformation; Transformation language; Modularity; Reusability; Adaptability; ATL


Science of Computer Programming
Volume 68, Issue 3, 1 October 2007, Pages 138-154
Special Issue on Model Transformation
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.