Towards Critical Pair Analysis for the Graph Programming Language GP 2 - Recent Trends in Algebraic Development Techniques Access content directly
Conference Papers Year : 2017

Towards Critical Pair Analysis for the Graph Programming Language GP 2

Ivaylo Hristakiev
  • Function : Author
  • PersonId : 1030919
Detlef Plump
  • Function : Author
  • PersonId : 1030920

Abstract

We present the foundations of critical pair analysis for the graph programming language GP 2. Our goal is to develop a static checker that can prove or refute confluence (functional behaviour) for a large class of graph programs. In this paper, we introduce symbolic critical pairs of GP 2 rule schemata, which are labelled with expressions, and establish the completeness and finiteness of the set of symbolic critical pairs over a finite set of rule schemata. We give a procedure for their construction.
Fichier principal
Vignette du fichier
433330_1_En_11_Chapter.pdf (359.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01767473 , version 1 (16-04-2018)

Licence

Attribution

Identifiers

Cite

Ivaylo Hristakiev, Detlef Plump. Towards Critical Pair Analysis for the Graph Programming Language GP 2. 23th International Workshop on Algebraic Development Techniques (WADT), Sep 2016, Gregynog, United Kingdom. pp.153-169, ⟨10.1007/978-3-319-72044-9_11⟩. ⟨hal-01767473⟩
77 View
37 Download

Altmetric

Share

Gmail Facebook X LinkedIn More