GrGen.NET is a programming tool for graph transformation, which eases the transformation of complex graph structured data as e.g. required in model transformation, computer linguistics, or modern compiler construction, comparable to other programming tools like parser generators which ease the task of formal language recognition, or relational databases which ease the task of persistent data storage and querying. Graph rewriting is the high-level way of processing pointer structures. GrGen.NET allows you to work at the abstraction level of graphs, with declarative pattern matching and rewriting, on a visualization of your mesh/network of objects, instead of low level pointer structure fiddling, chasing objects by following references in the debugger.

References in zbMATH (referenced in 21 articles , 1 standard article )

Showing results 1 to 20 of 21.
Sorted by year (citations)

1 2 next

  1. Barkowsky, Matthias; Giese, Holger: Hybrid search plan generation for generalized graph pattern matching (2020)
  2. Azzi, Guilherme Grochau; Bezerra, Jonas Santos; Ribeiro, Leila; Costa, Andrei; Rodrigues, Leonardo Marques; Machado, Rodrigo: The Verigraph system for graph transformation (2018)
  3. Müller, Peter (ed.); Schaefer, Ina (ed.): Principled software development. Essays dedicated to Arnd Poetzsch-Heffter on the occasion of his 60th birthday. Selected papers based on the presentations at the symposium, Kaiserslautern, Germany, November 2018 (2018)
  4. Eshuis, Rik; Van Gorp, Pieter: Synthesizing data-centric models from business process models (2016) ioport
  5. Drewes, Frank; Hoffmann, Berthold: Contextual hyperedge replacement (2015)
  6. Kirchner, Hélene: Rewriting strategies and strategic rewrite programs (2015)
  7. Sunkara, Vinodh Kumar; Sane, Aamod: Skeblle: a new kind of diagramming tool with programmable active diagrams (2015) ioport
  8. Bensch, Suna; Drewes, Frank; Jürgensen, Helmut; van der Merwe, Brink: Graph transformation for incremental natural language analysis (2014)
  9. Dietrich, Dominik; Whiteside, Iain; Aspinall, David: \textscPolar: a framework for proof refactoring (2013)
  10. Fernández, Maribel; Kirchner, Hélène; Namet, Olivier: A strategy language for graph rewriting (2012)
  11. Poskitt, Christopher M.; Plump, Detlef: Hoare-style verification of graph programs (2012)
  12. Biermann, Enrico; Ermel, Claudia; Lambers, Leen; Prange, Ulrike; Runge, Olga; Taentzer, Gabriele: Introduction to AGG and EMF Tiger by modeling a Conference Scheduling System (2010) ioport
  13. Horváth, Ákos; Bergmann, Gábor; Ráth, István; Varró, Dániel: Experimental assessment of combining pattern matching strategies with VIATRA2 (2010) ioport
  14. Jakumeit, Edgar; Buchwald, Sebastian; Kroll, Moritz: GrGen.NET. The expressive, convenient and fast graph rewrite system (2010) ioport
  15. Mészáros, Tamás; Mezei, Gergely; Levendovszky, Tihamér; Asztalos, Márk: Manual and automated performance optimization of model transformation systems (2010) ioport
  16. Poskitt, Christopher M.; Plump, Detlef: A Hoare calculus for graph programs (2010)
  17. Rensink, Arend: The edge of graph transformation -- graphs for behavioural specification (2010)
  18. Plump, Detlef: The graph programming language GP (2009)
  19. Bergmann, Gábor; Horváth, Ákos; Ráth, István; Varró, Dániel: A benchmark evaluation of incremental pattern matching in graph transformation (2008)
  20. Rensink, Arend; Van Gorp, Pieter: Graph-based tools: The contest (2008)

1 2 next