Skip to main content
Conference Proceedings

Towards critical pair analysis for the graph programming language GP 2

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2017) 10644 LNCS 153-169
DOI: 10.1007/978-3-319-72044-9_11
2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Hristakiev, I., & Plump, D. (2017). Towards critical pair analysis for the graph programming language GP 2. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10644 LNCS, pp. 153–169). Springer Verlag. https://doi.org/10.1007/978-3-319-72044-9_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free