The Agg Approach: Language and Environment

Graph Transformations

“…[9]). In fact it is not difficult to see, using the results of this paper, that conditional application conditions are expressively equivalent to the ∃¬∃¬∃-fragment of FOL, and graph constraints to the ¬∃¬∃-fragment.…”

Benchmarking for Graph Transformation

“…Moreover, graph transformation is a popular technique also for capturing model transformations. Its popularity in the field is indicated by the large variety of tools (such as AGG [15], Fujaba [16], Great [1], Groove [24], PROGRES [26], Viatra [28]). …”

A Strategy Language for Graph Rewriting

“…In AGG [19], application of rules can be controlled by defining layers and then iterating through and across layers. PROGRES [39] allows users to define the way rules are applied and includes non-deterministic constructs, sequence, conditional and loops.…”

“…Used for a long time in λ-calculus [8], strategies are present in programming languages such as Clean [33], Curry [24], and Haskell [25] and can be explicitely defined to rewrite terms in languages such as Elan [11], Stratego [42], Maude [29] or Tom [7]. They are also present in graph transformation tools such as PROGRES [39], AGG [19], Fujaba [32], GROOVE [37], GrGen [21] and GP [36]. PORGY's strategy language draws inspiration from these previous works, but a distinctive feature of PORGY's language is that it allows users to define strategies using not only operators to combine graph rewriting rules but also operators to define the location in the target graph where rules should, or should not, apply.…”