Tree-verifiable graph grammars
From MaRDI portal
Cites work
- A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions
- A note on undecidable properties of formal languages
- A spatial logic for querying graphs
- BI as an assertion language for mutable data structures
- Concurrency, graphs and models. Essays dedicated to Ugo Montanari on the occasion of his 65th birthday
- Effective entailment checking for separation logic with inductive definitions
- Entailment checking in separation logic with inductive definitions is 2-ExpTime hard
- Generalized records and spatial conjunction in role logic
- Regular expressions for tree-width 2 graphs
- Substructural logics: a primer
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- The tree width of separation logic with recursive definitions
This page was built for publication: Tree-verifiable graph grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025190)