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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Radke, H. (2010). Correctness of graph programs relative to HR+ conditions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6372 LNCS, pp. 410–412). https://doi.org/10.1007/978-3-642-15928-2_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
