Jon Haël Brenas - Verification of Graph Transformation

Organized by: 
Jon Haël Brenas
Jon Haël Brenas
Detailed information: 


The defense will take place  in room 320 of the UFR IM2AG, 60, rue de la Chimie 38400 Saint-Martin-d’Hère.

Jury :

  • M. Jean-Guillaume Dumas, Université Grenoble Alpes, examiner
  • M. Fernando Orejas, Universitat Politècnica de Catalunya, reviewer.
  • Mme Pascale Le Gall, Ecole Centrale Paris, reviewer.
  • M. Rachid Echahed, Université Grenoble Alpes, thesis advisor.
  • M. Martin Strecker, Université Paul Sabatier, examiner.



In computer science as well as multiple other fields, graphs have become ubiquitous. They are used to represent data in domains ranging from chemistry to architecture, as abstract structures or as models of the data or its evolution. In all these domains, graphs are expected to evolve over time due to chemical reactions, update of the knowledge or programs. Beingable to deal with such transformations is an extremely important and difficult task. In this work, our aim is to study the verification of such graph transformation, that is how to prove that a graph transformation is correct. Correctness of a graph transformation is more precisely defines as correctness of a specification for the transformation containing additionally a precondition and a postcondition. We decided to use a Hoare-like calculus generating the weakest precondition for a postcondition and a transformation. If this weakest precondition is implied by the actual precondition, the specification is correct. We chose a more algorithmic approach to graph transformation by using atomic actions.
We chose to define two ways to build graph transformations: using an imperative programming language and using rule-base rewriting systems. The main ingredient of the verification of graph transformation is the logic that is chosen to represent the precondition, the postcondition and the possible conditions internal to the transformation. So that the logic can interact with the calculus, we require that the decision problem be decidable, that the logic be closed under the substitutions introduced by the Hoare-like calculus and that it has to be able to express the existence and absence of a match for the transformation. The core result of this work is the identification and explanation of these conditions.