English

Solving the TTC 2011 Reengineering Case with MOLA and Higher-Order Transformations

Programming Languages 2011-11-22 v1 Software Engineering

Abstract

The Reengineering Case of the Transformation Tool Contest 2011 deals with automatic extraction of state machine from Java source code. The transformation task involves complex, non-local matching of model elements. This paper contains the solution of the task using model transformation language MOLA. The MOLA solution uses higher-order transformations (HOT-s) to generate a part of the required MOLA program. The described HOT approach allows creating reusable, complex model transformation libraries for generic tasks without modifying an implementation of a model transformation language. Thus model transformation users who are not the developers of the language can achieve the desired functionality more easily.

Cite

@article{arxiv.1111.4750,
  title  = {Solving the TTC 2011 Reengineering Case with MOLA and Higher-Order Transformations},
  author = {Agris Sostaks and Elina Kalnina and Audris Kalnins and Edgars Celms and Janis Iraids},
  journal= {arXiv preprint arXiv:1111.4750},
  year   = {2011}
}

Comments

In Proceedings TTC 2011, arXiv:1111.4407

R2 v1 2026-06-21T19:38:55.680Z