A Generic Approach to Detect Design Patterns in Model Transformations Using a String-Matching Algorithm
Chihab eddine Mokaddem, Houari Sahraoui, Eugene Syriani

TL;DR
This paper presents a generic, automated method for detecting design patterns in model transformation code using string-matching, aiding software engineers in understanding and maintaining complex model transformations.
Contribution
It introduces a novel, generic technique that automatically identifies design patterns and their variations in model transformation rules, including degenerate forms, to improve comprehension.
Findings
Effective detection of design patterns in model transformations.
Identification of pattern variations and degenerate forms.
Potential to enhance maintenance and understanding of model transformations.
Abstract
Maintaining software artifacts is among the hardest tasks an engineer faces. Like any other piece of code, model transformations developed by engineers are also subject to maintenance. To facilitate the comprehension of programs, software engineers rely on many techniques, such as design pattern detection. Therefore, detecting design patterns in model transformation implementations is of tremendous value for developers. In this paper, we propose a generic technique to detect design patterns and their variations in model transformation implementations automatically. It takes as input a set of model transformation rules and the participants of a model transformation design pattern to find occurrences of the latter in the former. The technique also detects certain kinds of degenerate forms of the pattern, thus indicating potential opportunities to improve the model transformation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
