From Separation Logic to Hyperedge Replacement and Back

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Original languageEnglish
Title of host publicationGraph Transformations
Subtitle of host publication4th International Conference, ICGT 2008, Leicester, United Kingdom, September 7-13, 2008. Proceedings
PublisherSpringer
Pages484-486
Number of pages3
Volume5214 LNCS
ISBN (Electronic)978-3-540-87405-8
ISBN (Print)978-3-540-87404-1
DOIs
Publication statusPublished - 2008
Event4th International Conference on Graph Transformations (ICGT 2008) - Leicester, United Kingdom
Duration: 7 Sept 200813 Sept 2008

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume5214
ISSN (Print)0302-9743

Conference

Conference4th International Conference on Graph Transformations (ICGT 2008)
Country/TerritoryUnited Kingdom
CityLeicester
Period7/09/0813/09/08

Cite this