Toggle Main Menu Toggle Search

Open Access padlockePrints

Formal Derivation of a Distributed Program in Event B

Lookup NU author(s): Dr Alexei Iliasov, Dr Elena Troubitsyna, Professor Alexander RomanovskyORCiD


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


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 correct-by-construction development of distributed programs. In our approach we take a systems view, i.e., formally model not only application but also its environment the middleware 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.

Publication metadata

Author(s): Iliasov A, Laibinis L, Troubitsyna E, Romanovsky A

Editor(s): Qin, S.C., Qiu, Z.Y.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 13th International Conference on Formal Engineering Methods

Year of Conference: 2011

Pages: 420-436

ISSN: 0302-9743 (print) 1611-3349 (online)

Publisher: Springer

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783642245589