Automated Proof Tactics for Model Transformation
Résumé
When model-driven engineering is applied to critical systems, proving the correctness of model transformations (MT) assumes great importance. For instance, users may want a guarantee that the transformation does not produce models that break a critical post-condition, or that it preserves the semantics of the transformed model. Methods for automatic proof of MT correctness have shown their effectiveness for simple transformations and/or correctness properties. However, arbitrarily complex transformations and properties may require interactive theorem proving, which is a very costly activity. In this paper, we aim at simplifying the development of interactive proofs for MTs written in the CoqTL transformation language by providing a set of automated proof tactics for MT certification. The tactics encode reasoning patterns that depend only on the semantics of the CoqTL engine, hence they are generally applicable to proofs on any CoqTL transformation. Each tactic is associated with a direction (forward if it derives facts about the target model given facts on the source model, backward if it derives facts on the source given facts on the target) and a subject (element or link, respectively if the tactic derives facts on elements or links). They are implemented as a set of lemmas and tactics for the Coq interactive theorem prover. In our experimentation, we show that these tactics allow us to write shorter and easier proofs. The source code for CoqTL and our tactics is provided at https://zenodo.org/records/11119867.
Domaines
Informatique [cs]
Fichier principal
Automated_Proof_Tactics_for_Model_Transformation___JOT.pdf (449)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|