A combinatorial testing strategy for concurrent programs

Abstract

One approach to testing concurrent programs is called reachability testing, which derives test sequences automatically and on‐the‐fly, without constructing a static model. Existing reachability testing algorithms are exhaustive in that they are intended to exercise all possible synchronization sequences of a concurrent program with a given input. In this paper, we present a new testing strategy, called t‐way reachability testing, that adopts the dynamic framework of reachability testing but selectively exercises a subset of synchronization sequences. The selection of the synchronization sequences is based on a combinatorial testing strategy called t‐way testing. We present an algorithm that implements t‐way reachability testing, and report the results of several case studies that were conducted to evaluate its effectiveness. The results indicate that t‐way reachability testing can substantially reduce the number of synchronization sequences exercised during reachability testing while still effectively detecting faults. Copyright © 2007 John Wiley & Sons, Ltd.

Structural Testing for Semaphore-Based Multithread Programs

“…Using controlled execution, it is possible to force the order these executions. Considering to first execution (PCPC) the executed paths and their synchronizations are: 2,3,4,5,6,8,9,10,11,12} π 1 = {1, 2,3,4,5,6,8,9,10,11,3,4,5,6,7,8,9,10,11,12} π 2 = {1, 2,3,4,5,6,8,9,10,11,3,4,5,6,7,8,9,10,11 To illustrate a communication fault consider that avail was initialized with 1 (1 0 ) and all synchronizations are correct. This fault can be revealed with the execution of the required elements comm-c-use (7 2 , 7 2 , avail) and edge-s (9 2 , 5 2 ).…”

“…In the literature there are some works that address testing of concurrent programs [4,5,6,7,8,9]. Most of these works propose a test model to represent the concurrent program and to support the testing application.…”

“…In recent works, Lei et. al [9] presents a combinatorial approach, called t-way, to reduce the number of synchronization sequences to be executed.…”

Mutation testing from probabilistic and stochastic finite state machines

“…Prob-abilities are highly relevant where resources are shared and so Quality of Service requirements can be probabilistic. In addition, many systems are probabilistic in nature due to either the use of communications over an unreliable medium or through the system consisting of several threads or parallel components and there being different possible synchronization sequences (see, for example, [36]). There are also a number of communications protocols, such as Bluetooth and Ethernet, that have probabilistic requirements [18].…”

Estudo e definição do teste de integração de software para o contexto de sistemas robóticos móveis

“…A partir daí, outros modelos e critérios de teste foram definidos (TAYLOR; LEVINE; KELLY, 1992;CHUNG, 1992;SOUTER;POLLOCK, 1998;TAI, 1996;CAR-VER;TAI, 2002;KRAWCZYK;WISZNIEWSKI, 1996;BECHINI;CUTAJAR;PRETE, 1998;PARK et al, 2007). Há vários estudos considerando abordagens de teste de alcançabilidade (LEI; CARVER, 2006;WONG W.E., 2008;LEI, 2004;LEI et al, 2007;PU;XU, 2008;YOUNG et al, 1995) e técnicas de teste de mutação ou perturbação SEN;ABADIR, 2010;.…”