Skip to Main content Skip to Navigation
Conference papers

Towards Critical Pair Analysis for the Graph Programming Language GP 2

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01767473
Contributor : Hal Ifip <>
Submitted on : Monday, April 16, 2018 - 11:35:03 AM
Last modification on : Monday, April 16, 2018 - 11:36:26 AM

File

433330_1_En_11_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

143

Files downloads

68