Verifying graph transformation systems with description logics
From MaRDI portal
Publication:1663990
DOI10.1007/978-3-319-92991-0_10zbMATH Open1394.68224OpenAlexW2805988959MaRDI QIDQ1663990FDOQ1663990
Jon Haël Brenas, Rachid Echahed, Martin Strecker
Publication date: 24 August 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-92991-0_10
Recommendations
- Verifying a behavioural logic for graph transformation systems
- Two-level reasoning about graph transformation programs
- A Temporal Graph Logic for Verification of Graph Transformation Systems
- Proving correctness of logically decorated graph rewriting systems
- Modeling and verifying graph transformations in proof assistants
Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27)
Cited In (12)
- Parallel rewriting of attributed graphs
- Title not available (Why is that?)
- A Temporal Graph Logic for Verification of Graph Transformation Systems
- Verifying a behavioural logic for graph transformation systems
- A strict constrained superposition calculus for graphs
- Development of Correct Graph Transformation Systems
- Nested Quantification in Graph Transformation Rules
- Title not available (Why is that?)
- A rule-based procedure for graph query solving
- Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations
- Monadic second-order incorrectness logic for GP 2
- Incorrectness logic for graph programs
This page was built for publication: Verifying graph transformation systems with description logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663990)
