Formal derivation of a distributed program in event B

Authors:
Alexei Iliasov;Linas Laibinis;Elena Troubitsyna;Alexander Romanovsky
Affiliations:
Newcastle University, UK;Åbo Akademi University, Finland;Åbo Akademi University, Finland;Newcastle University, UK
Venue:
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Year:
2011

Citing 8
Cited 1

A Discipline of Programming

A Discipline of Programming
Formal and incremental construction of distributed algorithms: on the distributed reference counting algorithm

Theoretical Computer Science - Applied semantics
Elections in a Distributed Computing System

IEEE Transactions on Computers
Implementation Issues Concerning the Action Systems Formalism

PDCAT '07 Proceedings of the Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies
An incremental development of the Mondex system in Event-B

Formal Aspects of Computing
Developing topology discovery in Event-B

Science of Computer Programming
Applying Event-B atomicity decomposition to a multi media protocol

FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Supporting reuse in event b development: modularisation approach

ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z

Node coordination in peer-to-peer networks

COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Achieving high dependability of distributed systems remains a major challenge due to complexity arising from concurrency and communication. There are a number of formal approaches to verification of properties of distributed algorithms. However, there is still a lack of methods that enable a transition from a verified formal model of communication to a program that faithfully implements it. In this paper we aim at bridging this gap by proposing a state-based formal approach to correctby-construction development of distributed programs. In our approach we take a systems view, i.e., formally model not only application but also its environment - themiddleware that supports it. We decompose such an integrated specification to obtain the distributed program that should be deployed on the targeted network infrastructure. To illustrate our approach, we present a development of a distributed leader election protocol.