Verifying graph transformation systems with description logics
From MaRDI portal
(Redirected from Publication:1663990)
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
Cited in
(18)- Two-level reasoning about graph transformation programs
- Parallel rewriting of attributed graphs
- Proving correctness of logically decorated graph rewriting systems
- A dynamic logic for termgraph rewriting
- A Temporal Graph Logic for Verification of Graph Transformation Systems
- Verifying a behavioural logic for graph transformation systems
- A Hoare-like calculus using the \(\mathrm{SROIQ}^{\sigma }\) logic on transformations of graphs
- Development of Correct Graph Transformation Systems
- Nested Quantification in Graph Transformation Rules
- A strict constrained superposition calculus for graphs
- Analysis of graph transformation systems: native vs translation-based techniques
- Modeling and verifying graph transformations in proof assistants
- scientific article; zbMATH DE number 1504837 (Why is no real title available?)
- A rule-based procedure for graph query solving
- Specification and verification of a linear-time temporal logic for graph transformation
- 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)
