%0 Conference Proceedings
%T Towards Critical Pair Analysis for the Graph Programming Language GP 2
%+ University of York [York, UK]
%A Hristakiev, Ivaylo
%A Plump, Detlef
%Z Part 4: Regular Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 23th International Workshop on Algebraic Development Techniques (WADT)
%C Gregynog, United Kingdom
%Y Phillip James
%Y Markus Roggenbach
%I Springer International Publishing
%3 Recent Trends in Algebraic Development Techniques
%V LNCS-10644
%P 153-169
%8 2016-09-21
%D 2016
%R 10.1007/978-3-319-72044-9_11
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.3
%2 https://inria.hal.science/hal-01767473/document
%2 https://inria.hal.science/hal-01767473/file/433330_1_En_11_Chapter.pdf
%L hal-01767473
%U https://inria.hal.science/hal-01767473
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG1-3
%~ IFIP-WADT
%~ IFIP-LNCS-10644