Fifth Transformation Tool Contest (TTC 2011)

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). 1 What is GrGen.NET? GRGEN.NET is an application domain neutral graph rewrite system [1], the feature highlights regarding practical relevance are: Fully Featured Meta Model: GRGEN.NET uses attributed and typed multigraphs with multiple inher-itance on node/edge types. Attributes may be typed with one of several basic types, user defined enums, or generic set, map, and array types. Expressive Rules, Fast Execution: The expressive and easy to learn rule specification language allows straightforward formulation of even complex problems, with an optimized implementation yield-ing high execution speed at modest memory consumption. Programmed Rule Application: GRGEN.NET supports a high-level rule application control language, Graph Rewrite Sequences (GRS), offering sequential, logical, iterative and recursive control plu