Parallel program design: a foundation
Parallel program design: a foundation
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Verification of sequential and concurrent programs (2nd ed.)
Verification of sequential and concurrent programs (2nd ed.)
Verification of Dynamic Constraints for B Event Systems under Fairness Assumptions
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
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
Towards Modelling Obligations in Event-B
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
A formal approach for the development of reactive systems
Information and Software Technology
A proof-based approach to verifying reachability properties
Proceedings of the 2011 ACM Symposium on Applied Computing
Proving Reachability in B using Substitution Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining formal methods for the development of reactive systems
International Journal of Computer Applications in Technology
Verification of LTL on b event systems
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
A fixpoint semantics of event systems with and without fairness assumptions
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Combining Formal Methods for the Development of Reactive Systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
| Hi-index | 0.02 |
We present a proposal of specification and proof of liveness properties in B event systems under fairness assumptions. We give proof obligations in order to prove basic progress properties in B event systems under two types of assumptions: minimal progress and weak fairness. We define proof obligations in terms of weakest preconditions, which allow us to prove basic liveness properties as usual B proof obligations.We suggest the use of unity "Leads To" operator to specify more general liveness properties. In this way, we integrate the unity logic in the specification and proof of B event systems.