From Separation Logic to Hyperedge Replacement and Back

(Extended Abstract)
  • Mike Dodds
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5214)


Hyperedge replacement grammars and separation-logic formulas both define classes of graph-like structures. In this paper, we describe two effective translations between restricted hyperedge replacement grammars and formulas in a fragment of separation logic. These translations preserve the semantics of formulas and grammars.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Drewes, F., Kreowski, H.-J., Habel, A.: Hyperedge replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1, pp. 95–162. World Scientific, Singapore (1997)Google Scholar
  2. 2.
    Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: Proceedings of the Seventeenth Annual IEEE Symposium on Logic in Computer Science (2002)Google Scholar
  3. 3.
    Distefano, D., O’Hearn, P.W., Yang, H.: A local shape analysis based on separation logic. In: 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Mike Dodds
    • 1
  1. 1.University of CambridgeUK

Personalised recommendations