A Precondition Calculus for Correct-by-Construction Graph Transformations - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

A Precondition Calculus for Correct-by-Construction Graph Transformations

Résumé

We aim at assisting developers to write, in a Hoare style, provably correct graph transformations expressed in the ALCQ Description Logic. Given a postcondition and a transformation rule, we compute the weakest precondition for developers. However, the size and quality of this formula may be complex and hard to grasp. We seek to reduce the weakest precondition’s complexness by a static analysis based on an alias calculus. The refined precondition is presented to the developer in terms of alternative formulae, each one specifying a potential matching of the source graph. The developer chooses then the formulae that correspond to his intention to obtain finally a correct-byconstruction Hoare triple.
Fichier principal
Vignette du fichier
makhlouf_22310.pdf (297.69 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03656662 , version 1 (02-05-2022)

Identifiants

  • HAL Id : hal-03656662 , version 1
  • OATAO : 22310

Citer

Amani Makhlouf, Christian Percebois, Hanh Nhi Tran. A Precondition Calculus for Correct-by-Construction Graph Transformations. Twelfth International Conference on Software Engineering Advances (ICSEA 2017), Oct 2017, Athens, Greece. pp.172-177. ⟨hal-03656662⟩
8 Consultations
5 Téléchargements

Partager

Gmail Facebook X LinkedIn More