A proof-based approach to verifying reachability properties

Amel Mammar (1, 2, 3, 4) , Marc Frappier (5) , Fama Diagne (2, 5, 3, 4)

1 METHODES-SAMOVAR - Méthodes et modèles pour les réseaux
2 LOR - Département Logiciels et Réseaux
3 SAMOVAR - Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux
4 CNRS - Centre National de la Recherche Scientifique
5 UdeS - Département d'informatique [Sherbrooke]

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 operation calls) 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 discharged using the prover of AtelierB. Our proposal is illustrated through a case study

Mots clés: Reachability properties; CTL formulas; B language; Proof obligations

Domaines: Modélisation et simulation

Amel Mammar, Marc Frappier, Fama Diagne. A proof-based approach to verifying reachability properties. SAC 2011 : 26th Symposium on Applied Computing, Mar 2011, Taichung, Taiwan. pp.1651 - 1657, ⟨10.1145/1982185.1982531⟩. ⟨hal-01303017⟩