Skip to main content
Conference Proceedings

From separation logic to hyperedge replacement and back

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5214 LNCS 484-486
DOI: 10.1007/978-3-540-87405-8_40
3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Dodds, M. (2008). From separation logic to hyperedge replacement and back. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5214 LNCS, pp. 484–486). https://doi.org/10.1007/978-3-540-87405-8_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free