GP 2

GP 2 is a visual, rule-based, non-deterministic graph programming language which frees programmers from handling low-level data structures for graphs. The main motivation behind GP 2 is facilitating formal reasoning about programs while supporting practical problem solving.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 12 articles )

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

  1. Campbell, Graham; Plump, Detlef: Confluence up to garbage in graph transformation (2021)
  2. Wulandari, Gia S.; Plump, Detlef: Verifying graph programs with monadic second-order logic (2021)
  3. Courtehoute, Brian; Plump, Detlef: A fast graph program for computing minimum spanning trees (2020)
  4. Wulandari, Gia S.; Plump, Detlef: Verifying graph programs with first-order logic (2020)
  5. Fernández, Maribel; Kirchner, Hélène; Pinaud, Bruno: Labelled port graph -- a formal structure for models and computations (2018)
  6. Fernández, Maribel; Kirchner, Hélène; Pinaud, Bruno; Vallet, Jason: Labelled graph strategic rewriting for social networks (2018)
  7. Hristakiev, Ivaylo; Plump, Detlef: Towards critical pair analysis for the graph programming language GP (2) (2017)
  8. Fernández, Maribel; Kirchner, Hélène; Pinaud, Bruno; Vallet, Jason: Labelled graph rewriting meets social networks (2016)
  9. Plump, Detlef: Reasoning about graph programs (2016)
  10. Kirchner, Hélene: Rewriting strategies and strategic rewrite programs (2015)
  11. Bensch, Suna; Drewes, Frank; Jürgensen, Helmut; van der Merwe, Brink: Graph transformation for incremental natural language analysis (2014)
  12. Plump, Detlef: The graph programming language GP (2009)


Further publications can be found at: https://uoycs-plasma.github.io/GP2/publications