ion levels. The formal de nition of this concept which can be found in e.g. [Bey92] regards graphs as a set of objects with three partial functions: the source, target, and abstraction function. They are totalized by including a special object ?. A node is an object for which both the source and target function are unde ned. There are a few rather obvious consistency conditions that are enforce...

Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical structure, and transformation rules are equipped with graph variables. In this paper we analyze conditions under which diverging transformation steps H ⇐ G ⇒ H ′ can be joined by subsequent transformation sequences H ∗ ⇒ M ∗ ⇐ ...

Graph transformation systems support the formal modeling of dynamic, concurrent, and distributed systems. States are given by their graphical structure, and transitions are modeled by graph transformation rules. In this paper we investigate two kinds of reenement relations for graph transformation systems in order to support the development of a module concept for graph transformation systems. ...

Shape graphs have been introduced in [Ren04a, Ren04b] as an abstraction to be used in model checking object oriented software, where states of the system are represented as graphs. Intuitively, the graphs modeling the states represent the structure of objects dynamically allocated in the heap. State transitions are then generated by applying graph transformation rules corresponding to the state...

The definition of the semantics of visual languages, in particular Unified Modeling Language (UML) diagrams, using graph formalism has known a wide success, since graphs fit the multi-dimensional nature of this kind of language. However, constraints written in Object Constraint Language (OCL) and defined on these models are still not well integrated within this graph-based semantics. In this ch...

Graph rewriting-based model transformation is an essential tool to process graph-based visual models. If the execution of transformations is not supported by the continuous presentation of the modifications performed on the model, the traceability and the debugging of transformations becomes difficult. Recent modeling tools usually support the definition of rewriting rules based transformations...

This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both the software system and its high-level view, known as the conceptual architecture. Modeling the recovery process as graph matching is an attempt to identify a sub-optimal transformation from a pattern graph, representi...

This thesis is concerned with the use of graph-transformation rules to specify and manipulate pointer structures. In it, we show that graph transformation can form the basis of a practical and well-formalised approach to specifying pointer properties. We also show that graph transformation rules can be used as an efficient mechanism for checking the properties of graphs. We make context-sensiti...

Graphs are a common means to represent structures in models and meta-models of software systems. In this context, the description of model domains by classifying the domain entities and their relations using class diagrams or type graphs has emerged as a very valuable principle. The constraints that can be imposed by pure typing are, however, relatively weak; it is therefore common practice to ...

Theories of graphs and graph transformations form an important part of the mathematical foun-dations of computing, and have been applied in a wide range of areas from the design and analysisof algorithms to the formalization of various computer systems and programs. In this thesis, westudy how graphs and graph transformations can be used to model the static structure and dynamic...