AGG 2.0 - New Features for Specifying and Analyzing Algebraic Graph Transformations

@inproceedings{Runge2011AGG2,
  title={AGG 2.0 - New Features for Specifying and Analyzing Algebraic Graph Transformations},
  author={Olga Runge and Claudia Ermel and Gabriele Taentzer},
  booktitle={AGTIVE},
  year={2011}
}
The integrated development environment AGG supports the specification of algebraic graph transformation systems based on attributed, typed graphs with node type inheritance, graph rules with application conditions, and graph constraints. It offers several analysis techniques for graph transformation systems including graph parsing, consistency checking of graphs as well as conflict and dependency detection in transformations by critical pair analysis of graph rules, an important instrument to… 
GRAPE - A Graph Rewriting and Persistence Engine
TLDR
Grape (Graph Rewriting and Persistence Engine), a hybrid, embedded Domain Specific Language for Clojure is introduced, a lightweight approach to computing with persistent graphs within Clojure that combines the ease of use of a textual DSL with a graphical visualization that is inlined with the program code when needed to aid comprehension and documentation of graph rewriting rules.
Static Verification Techniques for Attributed Graph Transformations
TLDR
This thesis shows that the proposed framework for attributed graph transformation systems preserves the fundamental theoretical results of the algebraic approach for graph transformations, and verifies the well-known results for the static verification of consistency constraints, conflict detection, and conflict resolution by confluence analysis within the framework.
Confluence analysis for a graph programming language
TLDR
This thesis extends the notion of conflict to GP 2 rules, and proves that non-conflicting rule applications commute, and specifies a confluence analysis algorithm based on symbolic critical pairs, and shows its soundness by proving the Local Confluence Theorem.
A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java
TLDR
A programming library for the rapid development of graph tools, with applications in graph transformation and related fields, to allow easy embedding into existing software, and to have comprehensible code especially for the main algorithms.
Efficient Graph Rewriting
TLDR
A new result that the graph class of trees can be recognised by a rooted GT system in linear time, given an input graph of bounded degree and a new notion of confluence modulo garbage and non-garbage critical pairs is defined.
Fast Rule-Based Graph Programs
Verified Operational Patterns with Graph Transformation
TLDR
This paper presents how one can precisely define the requirements for a domain-specific model pattern, and how to verify the requirements on the implemented patterns.
Graph Rewriting Techniques in Engineering Design
TLDR
An overview of the current state-of-the-art in graph rewriting and its applications in engineering design, with a focus on the built environment is provided.
Compiling Graph Programs to C
TLDR
This work shows how to generate efficient C code for a high-level domain-specific language for graphs, GP 2, based on graph transformation rules, and presents run-time experiments with the implementation in a case study on checking graphs for two-colourability.
Graph rewriting rules for RDF database evolution: optimizing side-effect processing
TLDR
This paper aims to propose a two-step framework where rewriting rules formalize instance or schema changes, ensuring graph’s consistency with respect to constraints, and updates are managed by ensuring rule applicability through the generation of side effects: new updates which guarantee that rule application conditions hold.
...
...

References

SHOWING 1-10 OF 21 REFERENCES
AGG: A Graph Transformation Environment for Modeling and Validation of Software
TLDR
AGG is a general development environment for algebraic graph transformation systems which follows the interpretative approach and supports several kinds of validations which comprise graph parsing, consistency checking of graphs and conflict detection in concurrent transformations by critical pair analysis of graph rules.
Efficient analysis and execution of correct and complete model transformations based on triple graph grammars
TLDR
This paper shows how to improve the efficiency of the execution and analysis of model transformations in practical applications by using triple rules with negative application conditions (NACs).
Applications of Graph Transformations with Industrial Relevance
TLDR
A Graph-Based System for Modeling and Managing Development Processes and Formal Integration of Software Engineering Aspects Using a Graph Rewrite System are presented.
Conflict Detection for Model Versioning Based on Graph Modifications
TLDR
Building up on the DPO approach to graph transformations, this work defines two different kinds of conflict detection: the check for operation-based conflicts, and theCheck for state- based conflicts on results of merged graph modifications.
Correctness of high-level transformation systems relative to nested conditions†
TLDR
It is shown that nested graph conditions are expressively equivalent to first-order graph formulas, and a part of the proof includes transformations between two satisfiability notions of conditions, namely -s Satisfiability and -satisfiability.
A Visual Interpreter Semantics for Statecharts Based on Amalgamated Graph Transformation
TLDR
The theory of amalgamation is built on from binary to multi-amalgamation including nested application conditions to control rule applications for automatic simulation and shows termination of the interpreter semantics of well-behaved statecharts.
Object Flow Definition for Refined Activity Diagrams
TLDR
This work defines a clear semantics for refined activity diagrams with object flow by using a graph transformation approach to formalize control flow by sets of transformation rule sequences, while object flow is described by partial dependencies between transformation rules.
Formal Analysis and Verification of Self-Healing Systems
TLDR
This paper presents sufficient static conditions for self-healing properties, deadlock-freeness and liveness of SH-systems, and applies this approach to a traffic light system case study, where the corresponding properties are verified.
Fundamentals of Algebraic Graph Transformation
This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. It contains an introduction to classical graphs. Basic and
Generation of Simulation Views for Domain Specific Modeling Languages Based on the Eclipse Modeling Framework
TLDR
This paper proposes a generic approach to specify DSML environments visually by models and transformation rules based on the Eclipse Modeling Framework (EMF), and presents the basic components of Tiger2, the EMF-based generation environment, along the environment generation process for a small DSML modeling the behavior of ants in an ant hill.
...
...