Correctness of graph programs relative to HR+ conditions

Authors:
Hendrik Radke
Affiliations:
Carl v. Ossietzky Universität Oldenburg, Germany
Venue:
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Year:
2010

Citing 4
Cited 0

Hyperedge Replacement: Grammars and Languages

Hyperedge Replacement: Grammars and Languages
A Discipline of Programming

A Discipline of Programming
Correctness of high-level transformation systems relative to nested conditions†

Mathematical Structures in Computer Science
Weakest preconditions for high-level programs

ICGT'06 Proceedings of the Third international conference on Graph Transformations

Quantified Score

Hi-index	0.00

Visualization

Abstract

In (Pennemann 2009), the correctness of graph programs relative to nested graph conditions is considered. Since these conditions are expressively equivalent to first-order graph formulas, non-local graph properties in the sense of Gaifman are not expressible by nested graph conditions. We generalize the concept of nested graph conditions to socalled HR+ conditions and investigate the correctness for graph programs relative to these generalized conditions.