From Separation Logic to Hyperedge Replacement and Back

DOI10.1007/978-3-540-87405-8_40zbMath1175.68218OpenAlexW1516610660MaRDI QIDQ3540425

Mike Dodds

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87405-8_40

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Related Items (2)

A proof procedure for separation logic with inductive definitions and data ⋮ Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic

Cites Work

• Handbook of Graph Grammars and Computing by Graph Transformation
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: From Separation Logic to Hyperedge Replacement and Back