Parallel program design: a foundation
Parallel program design: a foundation
Probabilistic self-stabilization
Information Processing Letters
Refinement calculus, part II: parallel and reactive programs
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
Reasoning about probabilistic parallel programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Randomized algorithms
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Termination of probabilistic concurrent programs: (extended abstract)
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic Verification of Probabilistic Free Choice
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
On the extremely fair treatment of probabilistic algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Developing topology discovery in Event-B
Science of Computer Programming
Probabilistic termination in B
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Qualitative probabilistic modelling in event-B
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Modeling in Event-B: System and Software Engineering
Modeling in Event-B: System and Software Engineering
Rodin: an open toolset for modelling and reasoning in Event-B
International Journal on Software Tools for Technology Transfer (STTT) - Special Section on VSTTE 2008
Reasoning about liveness properties in event-B
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
| Hi-index | 0.00 |
We propose an approach for proving that a system guarantees to establish a given property eventually with probability one. Using Event-B as our modelling language, our correctness reasoning is a combination of termination proofs (in terms of probabilistic convergence), deadlock-freedom and invariant techniques. We illustrate the approach by formalising some non-trivial algorithms, including the duelling cowboys, Herman's probabilistic self-stabilisation and Rabin's choice coordination. We extend the supporting Rodin Platform (Rodin) of Event-B to generate appropriate proof obligations for our reasoning, then subsequently (automatically/interactively) discharge the obligations using the built-in provers of Rodin.