Paper Info
Title
Reachability Testing: An Approach To Testing Concurrent Software
Abstract
Concurrent programs are more difficult to test than sequential programs because of nondeterministic behavior. An execution of a concurrent program non-deterministically exercises a sequence of synchronization events called a synchronization sequence (or SYN-sequence). Non-deterministic testing of a concurrent program P is to execute P with a given input many times in order to exercise distinct SYN-sequences. In this paper, we present a new testing approach called reachability testing. If every execution of P with input X terminates, reachability testing of P with input X derives and executes all possible SYN-sequences of P with input X. We show how to perform reachability testing of concurrent programs using read and write operations. Also, we present results of empirical studies comparing reachability and non-deterministic testing. Our results indicate that reachability testing has advantages over non-deterministic testing.
Year
DOI
Venue
1995
10.1142/S0218194095000241
INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING
Keywords
DocType
Volume
concurrent programs, software testing, non-deterministic testing, deterministic testing, reachability testing
Journal
5
Issue
ISSN
Citations 
4
0218-1940
40
PageRank 
References 
Authors
1.91
5
3
Name
Order
Citations
PageRank
Gwan-hwan Hwang119426.67
Kuo-chung Tai21274132.89
Ting-Lu Huang3998.31