Provably correct graph transformations with small-tALC - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Provably correct graph transformations with small-tALC

Abstract

We present a prototype for executing and verifying graph transformations. The transformations are written in a simple imperative programming language, and pre-and post-conditions as well as loop invariants are specified in the Description Logic ALC (whence the name of the tool). The programming language has a precisely defined operational semantics and a sound Hoare-style calculus. The tool consists of the following sub-components: a compiler to Java for executing the transformations; a verification condition generator; and a tableau prover for an extension of ALC capable of deciding the generated verification conditions. A description of these components and their interaction is the main purpose of this paper.
Fichier principal
Vignette du fichier
baklanova_17018.pdf (234.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01517373 , version 1 (03-05-2017)

Identifiers

  • HAL Id : hal-01517373 , version 1
  • OATAO : 17018

Cite

Nadezhda Baklanova, Jon Haël Brenas, Rachid Echahed, Christian Percebois, Martin Strecker, et al.. Provably correct graph transformations with small-tALC. 11th International Conference on ICT in Education, Research, and Industrial Applications (ICTERI 2015), May 2015, Lviv, Ukraine. pp. 78-93. ⟨hal-01517373⟩
515 View
21 Download

Share

Gmail Facebook X LinkedIn More