Skip to Main content Skip to Navigation
Conference papers

Rule-level verification of graph transformations for invariants based on edges' transitive closure

Christian Percebois 1 Martin Strecker 2 Hanh Nhi Tran 1 
1 IRIT-MACAO - Modèles, Architectures, Composants, Agilité et prOcessus
IRIT - Institut de recherche en informatique de Toulouse
Abstract : This paper develops methods to reason about graph transformation rules for proving the preservation of structural properties, especially global properties on reachability. We characterize a graph transformation rule with an applicability condition specifying the matching conditions of the rule on a host graph as well as the properties to be preserved during the transformation. Our previous work has demonstrated the possibility to reason about a graph transformation at rulelevel with applicability conditions restricted to Boolean combinations of edge expressions. We now extend the approach to handle the applicability conditions containing transitive closure of edges, which implicitly refer to an unbounded number of nodes. We show how these can be internalized into a finite pattern graph in order to enable verification of global properties on paths instead of local properties on edges only.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Monday, July 20, 2015 - 1:32:44 PM
Last modification on : Monday, July 4, 2022 - 8:59:17 AM
Long-term archiving on: : Wednesday, October 21, 2015 - 10:48:21 AM


Files produced by the author(s)


  • HAL Id : hal-01178554, version 1
  • OATAO : 12897


Christian Percebois, Martin Strecker, Hanh Nhi Tran. Rule-level verification of graph transformations for invariants based on edges' transitive closure. 11th International Conference Software Engineering and Formal Methods (SEFM 2013), Sep 2013, Madrid, Spain. pp. 106-121. ⟨hal-01178554⟩



Record views


Files downloads