Fairness
A proof system to derive eventuality properties under justice hypothesis
Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
Parallel program design: a foundation
Parallel program design: a foundation
ACM Transactions on Programming Languages and Systems (TOPLAS)
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
A construction of distributed reference counting
Acta Informatica
Incremental Proof of the Producer/Consumer Property for the PCI Protocol
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
B#: toward a synthesis between Z and B
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
A bridge between the asynchronous message passing model and local computations in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Formal derivation of a distributed program in event B
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Developing a consensus algorithm using stepwise refinement
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Designing old and new distributed algorithms by replaying an incremental proof-based development
Rigorous Methods for Software Construction and Analysis
Time constraint patterns for event b development
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
Formal development of wireless sensor-actor networks
Science of Computer Programming
| Hi-index | 0.00 |
The development of distributed algorithms and, more generally, distributed systems, is a complex, delicate and challenging process. Refinement techniques of (system) models improve the process by using a proof assistant, and by applying a design methodology aimed at starting from the most abstract model and leading, in an incremental way, to the most concrete model, for producing a distributed solution. We show, using the distributed reference counting (DRC) problem as our study, how models can be produced in an elegant and progressive way, thanks to the refinement and how the final distributed algorithm is built starting from these models. The development is carried out within the framework of the event B method and models are validated with a proof assistant.