Towards critical pair analysis for the graph programming language GP 2

DOI10.1007/978-3-319-72044-9_11MaRDI QIDQ5208506zbMATH OpenOpenAlexFDO

Authors Ivaylo Hristakiev, Detlef Plump

Publication date 16 January 2020

Published in Recent Trends in Algebraic Development Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-72044-9_11

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• The Graph Programming Language GP
• Reasoning about graph programs
• Critical pairs in term graph rewriting
• Confluence for graph transformations
• Abstract Critical Pairs and Confluence of Arbitrary Binary Relations

Cited in

(7)

• Granularity of conflicts and dependencies in graph transformation systems: a two-dimensional approach
• Unranked fuzzy logic and reasoning
• Theorem proving graph grammars with attributes and negative application conditions
• Unification of drags and confluence of drag rewriting
• The Graph Programming Language GP
• Reasoning about graph programs
• Linear-time graph algorithms in GP 2

Describes a project that uses

Uses Software

• GP 2

This page was built for publication: Towards critical pair analysis for the graph programming language GP 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208506)