Correct Transformation from CCSL to Promela for verification - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2012

Correct Transformation from CCSL to Promela for verification

(1) , (1)
1

Abstract

Transforming a specification language into a language supported by a verification tool is a widely adopted way of doing formal verification. It enables the reuse of existing languages and tools. In this paper, we propose a correct transformation from CCSL to Promela to do formal verification by SPIN. To implement the transformation, we introduce "coincident instant" into Promela to deal with the discrete time in CCSL. Then we define property patterns to ensure that correctness properties are verified "coincident instant" by "coincident instant" during the verification. We define checkpoint transition systems (CTSs) to model source CCSL specifications and transformed Promel models. The proof of the correctness of our transformation relies on the checkpoint bisimulation defined over CTS. If a property is satisfied by a transformed Promela model, then it is satisfied by the source CCSL specification.
Fichier principal
Vignette du fichier
RR-7491.pdf (1.31 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00667849 , version 1 (08-02-2012)

Identifiers

  • HAL Id : hal-00667849 , version 1

Cite

Frédéric Mallet, Ling Yin. Correct Transformation from CCSL to Promela for verification. [Research Report] RR-7491, INRIA. 2012, pp.33. ⟨hal-00667849⟩
310 View
387 Download

Share

Gmail Facebook Twitter LinkedIn More