Recommendations
Cites work
- Digraphs
- Hoare-style verification of graph programs
- Introduction to algorithms.
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Topology of series-parallel networks
- Verifying monadic second-order properties of graph programs
- Visual modelling of complex systems: towards an abstract machine for PORGY
Cited in
(18)- Confluence up to garbage in graph transformation
- Monadic second-order incorrectness logic for GP 2
- Incorrectness logic for graph programs
- Verifying graph programs with monadic second-order logic
- Two-level reasoning about graph transformation programs
- scientific article; zbMATH DE number 1701353 (Why is no real title available?)
- Hoare-style verification of graph programs
- scientific article; zbMATH DE number 5734944 (Why is no real title available?)
- The Graph Programming Language GP
- A Hoare calculus for graph programs
- Confluence up to garbage
- From imperative to rule-based graph programs
- Towards critical pair analysis for the graph programming language GP 2
- Linear-time graph algorithms in GP 2
- Mechanised DPO theory: uniqueness of derivations and Church-Rosser theorem
- Formalising the double-pushout approach to graph transformation
- A small-step operational semantics for GP 2
- On graph reasoning
This page was built for publication: Reasoning about graph programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015376)
