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
References in zbMATH (referenced in 7 articles )
Showing results 1 to 7 of 7.
- Fernández, Maribel; Kirchner, Hélène; Pinaud, Bruno: Labelled port graph -- a formal structure for models and computations (2018)
- Fernández, Maribel; Kirchner, Hélène; Pinaud, Bruno; Vallet, Jason: Labelled graph strategic rewriting for social networks (2018)
- Hristakiev, Ivaylo; Plump, Detlef: Towards critical pair analysis for the graph programming language GP (2) (2017)
- Fernández, Maribel; Kirchner, Hélène; Pinaud, Bruno; Vallet, Jason: Labelled graph rewriting meets social networks (2016)
- Kirchner, Hélene: Rewriting strategies and strategic rewrite programs (2015)
- Bensch, Suna; Drewes, Frank; Jürgensen, Helmut; van der Merwe, Brink: Graph transformation for incremental natural language analysis (2014)
- Plump, Detlef: The graph programming language GP (2009)
Further publications can be found at: https://uoycs-plasma.github.io/GP2/publications