From Separation Logic to Hyperedge Replacement and Back

Authors:
Mike Dodds
Affiliations:
University of Cambridge, UK
Venue:
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Year:
2008

Citing 3
Cited 1

Hyperedge replacement graph grammars

Handbook of graph grammars and computing by graph transformation
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A local shape analysis based on separation logic

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

A local greibach normal form for hyperedge replacement grammars

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.