Pages that link to "Item:Q2898467"
From MaRDI portal
The following pages link to Hoare-style verification of graph programs (Q2898467):
Displaying 18 items.
- From imperative to rule-based graph programs (Q516038) (← links)
- Juggrnaut: using graph grammars for abstracting unbounded heap structures (Q746781) (← links)
- Monadic second-order incorrectness logic for GP 2 (Q2096431) (← links)
- Incorrectness logic for graph programs (Q2117260) (← links)
- Verifying graph programs with monadic second-order logic (Q2117269) (← links)
- Theorem proving graph grammars with attributes and negative application conditions (Q2358623) (← links)
- Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations (Q2947219) (← links)
- Tool-Based Verification of a Relational Vertex Coloring Program (Q3460631) (← links)
- Interactive and automated proofs for graph transformations (Q4585009) (← links)
- A New Perspective on FO Model Checking of Dense Graph Classes (Q4635873) (← links)
- (Q5015376) (← links)
- (Q5020535) (← links)
- (Q5021228) (← links)
- Preserving consistency in geometric modeling with graph transformations (Q5059141) (← links)
- Graph Transformations (Q5292591) (← links)
- (Q5875357) (← links)
- (Q5875421) (← links)
- Decidability of Resilience for Well-Structured Graph Transformation Systems (Q6487305) (← links)