A proof-based approach to verifying reachability properties

Amel Mammar, Marc Frappier, Fama Diagne
2011 Proceedings of the 2011 ACM Symposium on Applied Computing - SAC '11  
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
more » ... tions are expressed as first logic formulas without any temporal operator, they can be achieved using the prover of AtelierB. Our proposal is illustrated through a case study.
doi:10.1145/1982185.1982531 dblp:conf/sac/MammarFD11 fatcat:xego2keujzerjdsxscz2lnpszi