Specifying Pointer Structures by Graph Reduction

Graph reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of balanced trees, that cannot be handled by existing methods.

[1]  Nils Klarlund,et al.  Graph types , 1993, POPL '93.

[2]  M. J. Plasmeijer,et al.  Term graph rewriting: theory and practice , 1993 .

[3]  Annegret Habel,et al.  Hyperedge Replacement, Graph Grammars , 1997, Handbook of Graph Grammars.

[4]  Berthold Hoffmann,et al.  Context-exploiting shapes for diagram transformation , 2003 .

[5]  Georg Struth,et al.  Relational and Kleene-Algebraic Methods in Computer Science , 2003, Lecture Notes in Computer Science.

[6]  Ralf Hinze,et al.  Perfect trees and bit-reversal permutations , 2000, J. Funct. Program..

[7]  David Walker,et al.  Alias Types for Recursive Data Structures , 2000, Types in Compilation.

[8]  Michael Benedikt,et al.  A Decidable Logic for Describing Linked Data Structures , 1999, ESOP.

[9]  Pascal Fradet,et al.  Type Checking for a Multiset Rewriting Language , 1996, LOMAPS.

[10]  Colin Runciman,et al.  Checking the Shape Safety of Pointer Manipulations , 2003, RelMiCS.

[11]  Alexandru Nicolau,et al.  Abstractions for recursive pointer data structures: improving the analysis and transformation of imperative programs , 1992, PLDI '92.

[12]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[13]  M. Minas,et al.  Application of graph transformation to visual languages , 1999 .

[14]  Anders Møller,et al.  The Pointer Assertion Logic Engine , 2000 .

[15]  Viktor Kuncak,et al.  Role analysis , 2002, POPL '02.

[16]  Frank Drewes.  NP-Completeness of k-Connected Hyperedge-Replacement Languages of Order k , 1993, Inf. Process. Lett..

[17]  Annegret Habel,et al.  Relabelling in Graph Transformation , 2002, ICGT.

[18]  Chris Reade.  Balanced Trees with Removals: An Exercise in Rewriting and Proof , 1992, Sci. Comput. Program..

[19]  Pascal Fradet,et al.  Shape types , 1997, POPL '97.

[20]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[21]  Annegret Habel,et al.  Double-pushout graph transformation revisited , 2001, Mathematical Structures in Computer Science.

[22]  Alexandru Nicolau,et al.  Abstractions for Recursive Pointer Data Structures: Improving the Analysis of Imperative Programs. , 1992, PLDI 1992.

[23]  Detlef Plump,et al.  Hypergraph rewriting: critical pairs and undecidability of confluence , 1993 .

[24]  Pascal Fradet,et al.  Structured Gamma , 1998, Sci. Comput. Program..

[25]  T. Uesu.  A system of graph grammars which generates all recursively enumerable sets of labelled graphs , 1978 .