![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
11th GCM@STAF 2020
- Berthold Hoffmann, Mark Minas:
Proceedings of the Eleventh International Workshop on Graph Computation Models, GCM@STAF 2020, Online-Workshop, 24th June 2020. EPTCS 330, 2020 - Nils Weidmann, Anthony Anjorin, James Cheney:
VICToRy: Visual Interactive Consistency Management in Tolerant Rule-based Systems. 1-12 - Christian Sandmann:
Graph Repair and its Application to Meta-Modeling. 13-34 - Okan Özkan:
Modeling Adverse Conditions in the Framework of Graph Transformation Systems. 35-54 - Dominique Duval, Rachid Echahed, Frédéric Prost:
An Algebraic Graph Transformation Approach for RDF and SPARQL. 55-70 - Hans-Jörg Kreowski, Aaron Lye
:
Graph Surfing in Reaction Systems from a Categorial Perspective. 71-87 - Andrea Corradini, Maryam Ghaffari Saadat, Reiko Heckel:
Encoding Incremental NACs in Safe Graph Grammars using Complementation. 88-107 - Tikhon Pshenitsyn:
Weak Greibach Normal Form for Hyperedge Replacement Grammars. 108-125 - Nicolas Behr, Maryam Ghaffari Saadat, Reiko Heckel:
Commutators for Stochastic Rewriting Systems: Theory and Implementation in Z3. 126-144 - Russ Harmer, Eugenia Oshurko:
Reversibility and Composition of Rewriting in Hierarchies. 145-162 - Brian Courtehoute
, Detlef Plump:
A Fast Graph Program for Computing Minimum Spanning Trees. 163-180 - Gia Septiana Wulandari
, Detlef Plump:
Verifying Graph Programs with First-Order Logic. 181-200
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.