Specifying graph languages with type graphs
From MaRDI portal
Publication:2423749
DOI10.1016/j.jlamp.2019.01.005zbMath1423.68248arXiv1704.05263OpenAlexW2912855617WikidataQ128486301 ScholiaQ128486301MaRDI QIDQ2423749
Barbara König, Dennis Nolte, Andrea Corradini
Publication date: 20 June 2019
Published in: Journal of Logical and Algebraic Methods in Programming, Graph Transformation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.05263
Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42) Special categories (18B99)
Related Items
Preface to the special issue on the 10th international conference on graph transformation ⋮ Specifying graph languages with type graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ CoReS: a tool for computing core graphs via SAT/SMT solvers ⋮ Confluence up to garbage in graph transformation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hyperedge replacement: grammars and languages
- Resources, concurrency, and local reasoning
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Rewriting abstract structures: materialization explained categorically
- Specifying graph languages with type graphs
- Fundamentals of algebraic graph transformation
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking
- Sound and Complete Abstract Graph Transformation
- Abstractions from proofs
- Counterexample-guided abstraction refinement for symbolic model checking
- A Modal-Logic Based Graph Abstraction
- On the Recognizability of Arrow and Graph Languages
- Handbook of Graph Grammars and Computing by Graph Transformation
- Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata
- Proving non-termination by finite automata
- Graph Transformations
- Programming Languages and Systems
- Adhesive and quasiadhesive categories
- A Logic of Graph Constraints
- Formal Methods in Software and Systems Modeling
- Tools and Algorithms for the Construction and Analysis of Systems