Evaluation of Rule-based Modularization in Model Transformation Languages illustrated with ATL

Ivan Ivanov, Klaas van den Berg, Frédéric Jouault

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    25 Citations (Scopus)


    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 base of the 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.
    Original languageUndefined
    Title of host publication21st Annual ACM Symposium on Applied Computing (SAC2006)
    PublisherAssociation for Computing Machinery (ACM)
    Number of pages8
    ISBN (Print)1-59593-108-2
    Publication statusPublished - Apr 2006
    Event21st Annual ACM Symposium on Applied Computing, SAC 2006 - Bourgogne University, Dijon, France
    Duration: 23 Apr 200627 Apr 2006
    Conference number: 21

    Publication series



    Conference21st Annual ACM Symposium on Applied Computing, SAC 2006
    Abbreviated titleSAC


    • reusability
    • EWI-9075
    • IR-63912
    • ATL
    • METIS-237910
    • Model Transformations
    • Modularity
    • Transformation languages
    • Adaptability

    Cite this