Pages that link to "Item:Q937301"
From MaRDI portal
The following pages link to A framework for the verification of infinite-state graph transformation systems (Q937301):
Displaying 18 items.
- Correct transformation: from object-based graph grammars to PROMELA (Q436353) (← links)
- Verification of graph grammars using a logical approach (Q436370) (← links)
- Monadic second-order incorrectness logic for GP 2 (Q2096431) (← links)
- Incorrectness logic for graph programs (Q2117260) (← links)
- Theorem proving graph grammars with attributes and negative application conditions (Q2358623) (← links)
- Unfolding Grammars in Adhesive Categories (Q2888498) (← links)
- An Institution for Graph Transformation (Q2890329) (← links)
- Reachability in Graph Transformation Systems and Slice Languages (Q2947215) (← links)
- The Edge of Graph Transformation — Graphs for Behavioural Specification (Q3059705) (← links)
- On GS-Monoidal Theories for Graphs with Nesting (Q3059707) (← links)
- Sound and Complete Abstract Graph Transformation (Q3098055) (← links)
- Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations (Q3447696) (← links)
- Interactive and automated proofs for graph transformations (Q4585009) (← links)
- (Q5021222) (← links)
- On the Decidability Status of Reachability and Coverability in Graph Transformation Systems (Q5111899) (← links)
- Processes and unfoldings: concurrent computations in adhesive categories (Q5740371) (← links)
- Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic (Q6151620) (← links)
- Invariant Analysis for Multi-agent Graph Transformation Systems Using k-Induction (Q6487310) (← links)