Solving the TTC 2011 Reengineering Case with GrGen.NET
Edgar Jakumeit (Karlsruhe Institute of Technology (KIT)), Sebastian, Buchwald (Karlsruhe Institute of Technology (KIT))
TL;DR
This paper demonstrates how GrGen.NET, a graph rewrite system, can effectively extract state machine models from Java program graphs to aid in software reengineering and understanding.
Contribution
It introduces a novel application of GrGen.NET for reengineering tasks, specifically extracting state machines from Java code graphs.
Findings
Successful extraction of state machines from Java program graphs
Enhanced understanding of program structure through reduced models
Demonstrated effectiveness of graph rewriting in software reengineering
Abstract
The challenge of the Reengineering Case is to extract a state machine model out of the abstract syntax graph of a Java program. The extracted state machine offers a reduced view on the full program graph and thus helps to understand the program regarding the question of interest. We tackle this task employing the general purpose graph rewrite system GrGen.NET (www.grgen.net).
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.