The graph programming language GP (Graph Programs) 2 and its implementation is the
subject of this thesis. The language allows programmers to write visual graph programs at a …

Wir studieren drei Aspekte der Programmverifikation mit Separation Logic (SL): 1. Die
Analyse quantitativer Eigenschaften, wie zB die Wahrscheinlichkeit der Terminierung ohne …

Graph transformation is the rule-based modification of graphs, and is a discipline dating
back to the 1970s. The declarative nature of graph rewriting rules comes at a cost. In …

This thesis presents a sound abstraction framework for the static analysis of pointer
programs, which is able to handle (recursive) procedures as well as concurrency. The …

Hyperedge-replacement grammars and separation-logic formulas both define classes of
graph-like structures. In this paper, we relate the different formalisms by effectively …

We study the relationship between two abstraction approaches for pointer programs,
Separation Logic and hyperedge replacement grammars. Both employ inductively defined …

Graph transformation is the rule-based modification of graphs, and is a discipline dating
back to the 1970s. In general, to match the left-hand graph of a fixed rule within a host graph …

This thesis concerns the time and space efficiency of programs in GP 2, a rule-based graph
transformation language that facilitates formal program analysis. Such programs are a …

This paper explores how to reason locally about global properties of graph transformations,
in particular properties involving transitive closure of the edge relations of the graph. We …

We present an approach for programming with graph transformation rules in which
programs can be as efficient as programs in imperative languages. The basic idea is to …