From Event-B specifications to programs for distributed algorithms Online publication date: Sat, 01-Oct-2016
by Mohamed Tounsi; Mohamed Mosbah; Dominique Méry
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 9, No. 3/4, 2016
Abstract: Formal proofs of distributed algorithms are long, hard and tedious. We propose a general approach, based on the Event-B formal method, to automatically generate correct programs of distributed algorithms. Our approach is implemented with a translation tool, called B2Visidia, that generates Java code from an Event-B specification related to distributed algorithms. The resulting code can be executed on classical distributed computing systems. To execute the resulting programs, we use a tool called Visidia that can be used for experimenting, testing and visualising programs of distributed algorithms.
Online publication date: Sat, 01-Oct-2016
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org