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

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

2011-11-21

arxiv.org/abs/1111.4750v1

EPTCS 74, 2011, pp. 159-167

Computer Science

Programming Languages

In Proceedings TTC 2011, arXiv:1111.4407

Scientific paper

10.4204/EPTCS.74.15

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.

Affiliated with

Also associated with

No associations

Rating

Solving the TTC 2011 Reengineering Case with MOLA and Higher-Order Transformations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving the TTC 2011 Reengineering Case with MOLA and Higher-Order Transformations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving the TTC 2011 Reengineering Case with MOLA and Higher-Order Transformations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-376005