Compatibility Checking for Asynchronously Communicating Software

Meriem Ouederni (1, 2) , Gwen Salaün (3) , Tevfik Bultan (4)

1 IRIT-ACADIE - Assistance à la Certification d’Applications DIstribuées et Embarquées
2 Toulouse INP - Institut National Polytechnique (Toulouse)
3 CONVECS - Construction of verified concurrent systems
4 CS-UCSB - Department of Computer Science [Santa Barbara]

Compatibility is a crucial problem that is encountered while constructing new software by reusing and composing existing components. A set of software components is called compatible if their composition preserves certain properties, such as deadlock freedom. However, checking compatibility for systems communicating asynchronously is an undecidable problem, and asynchronous communication is a common interaction mechanism used in building software systems. A typical approach in analyzing such systems is to bound the state space. In this paper, we take a different approach and do not impose any bounds on the number of participants or the sizes of the message buffers. Instead, we present a sufficient condition for checking compatibility of a set of asynchronously communicating components. Our approach relies on the synchronizability property which identifies systems for which interaction behavior remains the same when asynchronous communication is replaced with synchronous communication. Using the synchronizability property, we can check the compatibility of systems with unbounded message buffers by analyzing only a finite part of their behavior. We have implemented a prototype tool to automate our approach and we have applied it to many examples.

Domaines: Génie logiciel [cs.SE]

Meriem Ouederni, Gwen Salaün, Tevfik Bultan. Compatibility Checking for Asynchronously Communicating Software. FACS 2013, Oct 2013, Nanchang, China. ⟨hal-00913665⟩