Article

From Event-B Specifications to Programs for Distributed Algorithms

Authors:

Mohamed Tounsi,

Mohamed Mosbah, and

Dominique MeryAuthors Info & Claims

WETICE '13: Proceedings of the 2013 Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises

June 2013

Pages 104 - 109

https://doi.org/10.1109/WETICE.2013.44

Published: 17 June 2013 Publication History

Abstract

Formal proofs of distributed algorithms are long, hard and tedious. We propose a general approach, based on the formal method Event-B, 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 run on classical distributed computing systems. To execute the induced programs, we use a tool called Visidia that can be used for experimenting, testing and visualizing programs of distributed algorithms.

Cited By

View all

Eichler CDrira KMonteil TStolf PHaddad HWainwright RChbeir R(2018)Correctness by construction and style preserving reconfigurations of system of systemsProceedings of the 33rd Annual ACM Symposium on Applied Computing10.1145/3167132.3167312(1680-1686)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.1145/3167132.3167312
Gomes VKleppmann MMulligan DBeresford A(2017)Verifying strong eventual consistency in distributed systemsProceedings of the ACM on Programming Languages10.1145/31339331:OOPSLA(1-28)Online publication date: 12-Oct-2017
https://dl.acm.org/doi/10.1145/3133933
Boussabbeh MTounsi MMosbah MKacem A(2016)Formal Proofs of Termination Detection for Local Computations by Refinement-Based CompositionsProceedings of the 5th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z - Volume 967510.1007/978-3-319-33600-8_12(198-212)Online publication date: 23-May-2016
https://dl.acm.org/doi/10.1007/978-3-319-33600-8_12

Index Terms

From Event-B Specifications to Programs for Distributed Algorithms
1. Software and its engineering
  1. Software creation and management
    1. Software development process management
  2. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles

Index terms have been assigned to the content through auto-classification.

Recommendations

From Event-B specifications to programs for distributed algorithms

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 ...
Read More
Towards the Composition of Specifications in Event-B

The development of a system can start with the creation of a specification. Following this viewpoint, we claim that often a specification can be constructed from the combination of specifications which can be seen as composition. Event-B is a formal ...
Read More
Code generation for Event-B

Event-B is a modelling language and a formal methods approach for correct construction of software. This paper presents our work on code generation for Event-B, including the definition of a syntactic translation from Event-B to JML-annotated Java ...
Read More

Comments

Information & Contributors

Information

Published In

WETICE '13: Proceedings of the 2013 Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises

June 2013

382 pages

ISBN:9780769550022

Publisher

IEEE Computer Society

United States

Publication History

Published: 17 June 2013

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

View all

Eichler CDrira KMonteil TStolf PHaddad HWainwright RChbeir R(2018)Correctness by construction and style preserving reconfigurations of system of systemsProceedings of the 33rd Annual ACM Symposium on Applied Computing10.1145/3167132.3167312(1680-1686)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.1145/3167132.3167312
Gomes VKleppmann MMulligan DBeresford A(2017)Verifying strong eventual consistency in distributed systemsProceedings of the ACM on Programming Languages10.1145/31339331:OOPSLA(1-28)Online publication date: 12-Oct-2017
https://dl.acm.org/doi/10.1145/3133933
Boussabbeh MTounsi MMosbah MKacem A(2016)Formal Proofs of Termination Detection for Local Computations by Refinement-Based CompositionsProceedings of the 5th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z - Volume 967510.1007/978-3-319-33600-8_12(198-212)Online publication date: 23-May-2016
https://dl.acm.org/doi/10.1007/978-3-319-33600-8_12

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations