Stefan Rieger

Learn More
Techniques for the verification of elementary properties of concurrent pointer programs are indispensable. Programming with pointers is error–prone with potential pitfalls such as dereferencing null pointers and the creation of memory leaks. Pointer programming becomes even more vulnerable in a concurrent setting where data structures such as linked lists(More)
We present a new abstraction method for heap structures that is based on hyperedge replacement grammars. We use labeled hy-pergraphs as abstract representation of heap structures. A given hyper-graph replacement grammar induces a set of concrete heap structures from a hypergraph. Our technique allows to abstract and concretize the heap partially. Thus the(More)