A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Towards a Rule-Level Verification Framework for Property-Preserving Graph Transformations
2012
2012 IEEE Fifth International Conference on Software Testing, Verification and Validation
We report in this paper a method for proving that a graph transformation is property-preserving. Our approach uses a relational representation for graph grammar and a logical representation for graph properties with first-order logic formulas. The presented work consists in identifying the general conditions for a graph grammar to preserve graph properties, in particular structural properties. We aim to implement all the relevant notions of graph grammar in the Isabelle/HOL proof assistant in
doi:10.1109/icst.2012.200
dblp:conf/icst/TranP12
fatcat:m4okfc5qb5hr5ei2aext3gdpla