Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Reachability testing of asynchronous message-passing programs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Kuo-Chung Tai ; Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA

An execution of a message-passing program P with input X exercises a sequence of send and receive events, called a send-receive sequence (or SR-sequence). Assume that every execution of P with input X terminates. Reachability testing of P with input X is to execute all possible SR-sequences of P with input X. To perform reachability testing of P with input X, we first execute P with input X to collect one or more SR-sequences. For each collected SR-sequence, we identify its race conditions and derive its race-variants by modifying the outcome of race conditions. These race-variants are prefixes of other SR-sequences of P with input X. We use these race-variants to force P with input X to produce additional SR-sequences. By repeating this process, we eventually collect all possible SR-sequences of P with input X and thus can determine the correctness of P with input X. In this paper, we show derivation of race-variants of SR-sequences based on asynchronous communication and give an algorithm for reachability testing of asynchronous message-passing programs

Published in:

Software Engineering for Parallel and Distributed Systems, 1997. Proceedings., Second International Workshop on

Date of Conference:

17-18 May 1997