Efficient Reachability Testing of Asynchronous Message-Passing Programs

  • Authors:
  • Yu Lei;Kuo-Chung Tai

  • Affiliations:
  • -;-

  • Venue:
  • ICECCS '02 Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

An asynchronous message-passing program isnondeterministic. Given the same input, multipleexecutions of P may exercise different send/receiveevent sequences (or SR-sequences) and may evenproduce different results. Such nondeterminacymakes it difficult to determine the correctness of P.Let X be an input of P. Assume that any execution of P with X terminates. Reachability testing ofP with X is to execute, in a systematic manner, allpossible SR-sequences of P with X such that the correctnessof P with X can be determined. The basicidea of reachability testing is described as follows.We first execute P with X nondeterministically tocollect one or more SR-sequences. F or each collectedSR-sequence, we analyze its race conditions andgenerate race variants, which are prefixes of otherSR-sequences. We replay race variants to generatenew SR-sequences. F or each new SR-sequence, werepeat the same process until we eventually executeall possible SR-sequences of P with X. In this paper,we describe an efficient implementation of reachabilitytesting of asynchronous message-passing programs.Our technique deals with partially-orderedSR-sequences and reduces the complexity and redundancy caused by totally-ordered SR-sequences.