Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
A discipline of multiprogramming: programming theory for distributed applications
A discipline of multiprogramming: programming theory for distributed applications
Introducing Dynamic Constraints in B
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
Specification and Proof of Liveness Properties under Fairness Assumptions in B Event Systems
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
A Deductive Proof System for CTL
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A compositional approach to CTL* verification
Theoretical Computer Science - Formal methods for components and objects
Proving the Correctness of Multiprocess Programs
IEEE Transactions on Software Engineering
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Combining UML, ASTD and B for the formal specification of an access control filter
Innovations in Systems and Software Engineering
Proving Reachability in B using Substitution Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
ACM SIGSOFT Software Engineering Notes
| Hi-index | 0.00 |
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.