Hoare-style verification of graph programs
From MaRDI portal
Recommendations
Cited in
(22)- Tool-Based Verification of a Relational Vertex Coloring Program
- scientific article; zbMATH DE number 1390250 (Why is no real title available?)
- Translating essential OCL invariants to nested graph constraints focusing on set operations
- Preserving consistency in geometric modeling with graph transformations
- Theorem proving graph grammars with attributes and negative application conditions
- A Hoare calculus for graph programs
- scientific article; zbMATH DE number 7649899 (Why is no real title available?)
- Decidability of Resilience for Well-Structured Graph Transformation Systems
- Interactive and automated proofs for graph transformations
- A Hoare-like calculus using the \(\mathrm{SROIQ}^{\sigma }\) logic on transformations of graphs
- scientific article; zbMATH DE number 7456057 (Why is no real title available?)
- The Graph Programming Language GP
- Reasoning about graph programs
- Analysis of graph transformation systems: native vs translation-based techniques
- Juggrnaut: using graph grammars for abstracting unbounded heap structures
- Graph Transformations
- Verifying monadic second-order properties of graph programs
- From imperative to rule-based graph programs
- scientific article; zbMATH DE number 7649962 (Why is no real title available?)
- Monadic second-order incorrectness logic for GP 2
- Incorrectness logic for graph programs
- Verifying graph programs with monadic second-order logic
This page was built for publication: Hoare-style verification of graph programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898467)