The following pages link to (Q2769432):
Displaying 21 items.
- From imperative to rule-based graph programs (Q516038) (← links)
- Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing (Q553930) (← links)
- Context-sensitive fusion grammars and fusion grammars with forbidden context are universal (Q2084774) (← links)
- Monadic second-order incorrectness logic for GP 2 (Q2096431) (← links)
- A calculus of concurrent graph-rewriting processes (Q2291821) (← links)
- Modeling pointer redirection as cyclic term-graph rewriting (Q2867899) (← links)
- Undecidable control conditions in graph transformation units (Q2873611) (← links)
- Rewriting Strategies and Strategic Rewrite Programs (Q2945718) (← links)
- High-Level Programs and Program Conditions (Q3540400) (← links)
- Resolution-Like Theorem Proving for High-Level Conditions (Q3540406) (← links)
- Graph Multiset Transformation as a Framework for Massively Parallel Computation (Q3540410) (← links)
- Development of Correct Graph Transformation Systems (Q3540429) (← links)
- Strategic port graph rewriting: an interactive modelling framework (Q4629264) (← links)
- GETGRATS (Q4923529) (← links)
- (Q5020537) (← links)
- (Q5020539) (← links)
- Preserving consistency in geometric modeling with graph transformations (Q5059141) (← links)
- Completeness of Conversion between Reactive Programs for Ultrametric Models (Q5300904) (← links)
- An Algorithm for Approximating the Satisfiability Problem of High-level Conditions (Q5403460) (← links)
- The York Abstract Machine (Q5404181) (← links)
- Finding the right way to Rome: effect-oriented graph transformation (Q6535506) (← links)
