Empirical evaluation of a new composite approach to the coverage criteria and reachability testing of concurrent programs

2015 ◽  
Vol 25 (3) ◽  
pp. 310-332 ◽  
Author(s):  
S. R. S. Souza ◽  
P. S. L. Souza ◽  
M. A. S. Brito ◽  
A. S. Simao ◽  
E. J. Zaluska
Keyword(s):  
Empirical Evaluation ◽  
Concurrent Programs ◽  
Coverage Criteria ◽  
Composite Approach ◽  
Reachability Testing

REACHABILITY TESTING: AN APPROACH TO TESTING CONCURRENT SOFTWARE

1995 ◽  
Vol 05 (04) ◽  
pp. 493-510 ◽  
Author(s):  
GWAN-HWAN HWANG ◽  
KUO-CHUNG TAI ◽  
TING-LU HUANG
Keyword(s):  
Empirical Studies ◽  
Concurrent Programs ◽  
Concurrent Software ◽  
Sequential Programs ◽  
Concurrent Program ◽  
Testing Approach ◽  
Reachability Testing ◽  
Deterministic Behavior

Concurrent programs are more difficult to test than sequential programs because of non-deterministic 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.

Reachability testing of concurrent programs

2006 ◽  
Vol 32 (6) ◽  
pp. 382-403 ◽  
Author(s):  
Y. Lei ◽  
R.H. Carver
Keyword(s):  
Concurrent Programs ◽  
Reachability Testing
Sign in / Sign up

Export Citation Format

Share Document