Towards Incremental Deductive Verification for ATL - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Towards Incremental Deductive Verification for ATL


In this work, we address the performance problem in the deductive verification of model transformations written in the ATL language w.r.t. given contracts. Our solution is to enable incremental verification for ATL transformations through caching and reusing of previous verification results. Specifically, we decompose the original OCL contract into sub-goals, and cache the verification result of each of them. We show that for ATL, the syntactic relationship between a model transformation change and a sub-goal can be used to determine if a cached verification result needs to be re-computed. We justify the soundness of our approach and its practical applicability through a case study.
Fichier principal
Vignette du fichier
VoltPaper3.pdf (348.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01383886 , version 1 (21-10-2016)


  • HAL Id : hal-01383886 , version 1


Zheng Cheng, Massimo Tisi. Towards Incremental Deductive Verification for ATL. Verification of Model Transformation, Oct 2016, Saint-Malo, France. pp.38-47. ⟨hal-01383886⟩
186 View
83 Download


Gmail Facebook X LinkedIn More