Formal Verification Approaches for Distributed Algorithms: A Systematic Literature Review

Distributed algorithms have become a rapidly growing field of research due to the advances of the network technologies. However, they are very difficult to implement correctly because they must meet many requirements. In this paper, we follow the guidelines of systematic literature reviews to provide a survey of the existing works ensuring the formal verification of distributed algorithms in static and dynamic networks. Then, we develop a taxonomy of these solutions based on some criteria. Also, a discussion on each criterion is shown with a focus on constraints, requirements and challenges. Finally, we identify some recommendations and open research areas which can motivate the development of more efficient solutions. So, throughout this present paper, we provide information for researchers and developers to understand the contributions and challenges of the existing solutions to pave the way for enhancing their reliability.