Correctness of graph programs relative to HR+ conditions
2010
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.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
13
References
2
Citations
NaN
KQI