Verifying and Constructing Abstract TLA Specifications: Application to the Verification of C programs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Verifying and Constructing Abstract TLA Specifications: Application to the Verification of C programs

Résumé

One approach to verify the correctness of a system is to prove that it implements an executable (specification) model whose correctness is more obvious. Here, we define a kind of automata whose state is the product of values of multiple variables that we name State Transition System (STS). We define the semantics of TLA+ (specification language of the Temporal Logic of Actions) constructs using STSs, in particular the notions of TLA+ models, data hiding, and implication between models. We implement these concepts and prove their usefulness by applying them to the verification of C programs against abstract (TLA+ or STS) models and properties.
Fichier principal
Vignette du fichier
article_icsea.pdf (740.84 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01501469 , version 1 (12-04-2017)

Identifiants

  • HAL Id : hal-01501469 , version 1

Citer

Amira Methni, Matthieu Lemerre, Belgacem Ben Hedia, Serge Haddad, Kamel Barkaoui. Verifying and Constructing Abstract TLA Specifications: Application to the Verification of C programs. Tenth International Conference on Software Engineering Advances (ISCEA 2015), Nov 2015, Barcelone, Spain. ⟨hal-01501469⟩
212 Consultations
229 Téléchargements

Partager

Gmail Facebook X LinkedIn More