Proc. of the European symposium on programming on ESOP 86
A theoretical basis for stepwise refinement and the programming calculus
Science of Computer Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Beauty is our business
Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Randomized mutual exclusion algorithms revisited
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Probabilistic models for the guarded command language
Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
A Discipline of Programming
On the Refinement Calculus
The Generalised Substitution Language Extended to Probabilistic Programs
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
Towards a Calculus of Data Refinement
Proceedings of the International Conference on Mathematics of Program Construction, 375th Anniversary of the Groningen University
SLIPE '85 Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
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
Model checking hierarchical probabilistic systems
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Refinement-based verification of local synchronization algorithms
FM'11 Proceedings of the 17th international conference on Formal methods
An open extensible tool environment for event-b
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Justifications for the event-b modelling notation
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
Approaches to modelling security scenarios with domain-specific languages
SP'12 Proceedings of the 20th international conference on Security Protocols
Hi-index | 0.00 |
Among the many opportunities offered by computational semantics for probability, the challenge of probabilistic Event B (pEB) is one of the most attractive. The B method itself is now almost 20 years old, and has been much improved and adapted over that time by the many projects to which it has been applied, and by its philosophy —right from the start— that it must be practical, effective and amenable to tool support.; more recently, EventB has extended it and altered its style of use. The probabilistic-program semantics we appeal to is even older (in Kozen's original form), but has only recently been “revived” in the context of B-style abstraction and refinement. The especial attraction of putting the two together is the likely interplay between the probabilistic theory, on the one hand, and the decades of practical experience that have by now been built-in to the B approach, on the other. In particular, there are areas where a full theoretical treatment of probability, concurrency, abstraction and refinement —all at once— seems prohibitively complex; and yet in practice either the complexities seldom occur, or the exigencies of B's having been so-often applied to real, non-toy problems has forced it to evolve styles for avoiding such complexities. In short, we want to use (event) B to guide us towards the issues that truly are important. Rabin's randomized mutual-exclusion algorithm is used as a motivating case study.