A proof-based approach to verifying reachability properties - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

A proof-based approach to verifying reachability properties

Résumé

This paper presents a formal approach to proving temporal reachability properties, expressed in CTL, on B systems. We are particularly interested in demonstrating that a system can reach a given state by executing a sequence of actions or operations called a path. Starting with a path, the proposed approach consists in calculating the proof obligations to discharge in order to prove that the path allows the system to evolve in order to verify the desired property. Since these proof obligations are expressed as first logic formulas without any temporal operator, they can be achieved using the prover of Atelier B. Our proposal is illustrated through a case study
Fichier non déposé

Dates et versions

hal-01306183 , version 1 (22-04-2016)

Identifiants

  • HAL Id : hal-01306183 , version 1

Citer

Amel Mammar, Fama Diagne, Marc Frappier. A proof-based approach to verifying reachability properties. WOBD 2010 : Workshop on B Dissemination, Nov 2010, Natal, Brazil. ⟨hal-01306183⟩
25 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More