A modular framework for verifying versatile distributed systems

• Published in: Journal of logical and algebraic methods in programming Vol. 108; pp. 24 - 46
• Main Authors: Chevrou, Florent, Hurault, Aurélie, Quéinnec, Philippe
• Format: Journal Article
• Language: English
• Published: Elsevier 01.11.2019
• Subjects: Computer Science; Embedded Systems; Software Engineering; Multicast; Asynchronous communication; Compatibility checking; Distributed systems; TLA+
• DOI: 10.1016/j.jlamp.2019.05.008
• ISSN: 2352-2208

Putting independent components together is a common design practice of distributed systems. Besides, there exists a wide range of interaction protocols that dictate how these components interact, which impacts their compatibility. However, the communication model itself always consists in a monolithic description of the rules and properties of the communication. In this paper, we propose a mechanized framework for the compatibility checking of compositions of peers where the interaction protocol can be fine tuned through assembly of basic properties on the communication. These include whether the communication is point-to-point, multicast or convergecast, which ordering-policies are to be applied, applicative priorities, bounds on the number of messages in transit, and so on. Among these properties, we focus on a generic description of multicast communication that encompasses point-to-point and one-to-all communication as special cases. The components that form the communication model are specified in TLA+, and a system, composed of a communication model and a specification of the behavior of the peers (also in TLA+ ), is checked with the TLA+ model checker. Eventually we provide theoretical views on the relations between ordering-policies through the lenses of multicast and convergecast communication.