This paper proposes a case for the GraBaTs’08 tool contest. The graph transformation system to be implemented shall (i) import a graph-based representation of models of Java programs in a Gxl-based format, (ii) allow these models to be transformed interactively with three well-known program refactorings Encapsulate Field, Move Method, and Pull-up Method, and (iii) export the resulting models in...

GP (for Graph Programs) is an experimental nondeterministic programming language for solving problems on graphs and graph-like structures. The language is based on graph transformation rules, allowing visual programming at a high level of abstraction. In particular, GP frees programmers from dealing with low-level data structures. In this paper, we present a Hoare-style proof system for verifyi...

In the paper Support for Design Patterns through Graph Transformation Tools in this volume, we have already outlined the global structure of a tool that allows for the analysis and transformation of software architectures using graph tests and rewrite rules, respectively. We demonstrate the use of this approach in the specific domain of distributed systems. A specific instance of a graph based ...

Graph pattern matching is among the most costly operations in any graph transformation system. Incremental pattern matching aims at reducing this cost by incrementally updating, as opposed to totally recalculating, the possible matches of rules in the graph grammar at each step of the transformation. In this paper an implementation of one such algorithm is discussed with respect to the GROOVE t...

This work aims to extend the algebraical approach to graph transformation to model object-oriented systems structures and computations. A graph grammar based formal framework for object-oriented system modeling is presented, incorporating both the static aspects of system modeling and the dynamic aspects of computation of objectoriented programs.

It is well known that a non-binary constraint satisfaction problem (CSP) can be transformed into an equivalent binary CSP using the dual graph transformation. It is also known that the dual graph transformation is impractical in some cases where the CSP has a large number of constraints and/or the constraints have a larger number of satisfying tuples. However, little work has been done on impro...

Graph transformation units are rule-based entities that allow to transform source graphs into target graphs via sets of graph transformation rules according to a control condition. The graphs and rules are taken from an underlying graph transformation approach. Graph transformation units specify model transformations whenever the transformed graphs represent models. This paper is based on the o...