Statement-Coverage Testing for Nondeterministic Concurrent Programs

Hwang, Gwan-Hwan; Lin, Heng-Yi; Lin, Shaoyan; Lin, Che-Sheng

doi:10.1109/tase.2012.21

Cited by 3 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The work by PU Fangli et al defined a relation named little strong happen before for concurrent programs to select the reduced number of SYN sequences with high practicability. An approach for automatic selection of input that guides the reachability testing for statement coverage was proposed by Gwan‐Hwan Hwang et al . In this approach, a sequence of path conditions was derived from the SYN sequence , and these collected path conditions were used for developing a constraint solver for deriving new inputs and to find dead codes in concurrent programs.…”

Section: Overview Of Studiesmentioning

confidence: 99%

A systematic review of approaches for testing concurrent programs

Arora

Bhatia

Singh

2015

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYConcurrent programs are replacing the sequential programs as they utilize the true capabilities of multicore architecture. The extensive use of multicore systems and multithreaded paradigms warrants more attention to the testing of the concurrent programs. The testing concurrent program is not a new field as it has been more than 40 years because the first problem related to the testing concurrent program was addressed by the researchers. The field covers various domains, which include concurrency problems, testing approaches, techniques, graphical representations, tools, and subject systems. This paper aims at providing an overview of research in the domain of testing concurrent programs by classifying it into eight categories: (a) reachability testing, (b) structural testing, (c) model-based testing, (d) mutation-based testing, (e) slicing-based testing, (f) formal methods, (g) random testing, and (h) search-based testing. The survey is focused on the techniques applied, methodologies followed, and tools used in these aforementioned approaches. Furthermore, the gaps are also identified in different approaches. The paper concludes with the consolidation of various testing parameters along with the future directions.

show abstract

Section: Overview Of Studiesmentioning

confidence: 99%

A systematic review of approaches for testing concurrent programs

Arora

Bhatia

Singh

2015

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Ratsaby et al introduce the concept of coverability, which refers to the degree to which a state‐machine model can be covered when subjected to testing. Coverability analysis establishes goals and during the test is observed if these goals are reached or not.…”

Section: Related Workmentioning

confidence: 99%

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

Souza

Brito

et al. 2015

Software Testing Verif & Rel

View full text Add to dashboard Cite

SUMMARYTesting is a key activity to assure the quality of concurrent applications. In recent years, a variety of different mechanisms have been proposed to test concurrent software. However, a persistent problem is the high testing cost because of the large number of different synchronization sequences that must be tested. When structural testing criteria are adopted, a large number of infeasible synchronization sequences is generated, increasing the testing cost. Although the use of reachability testing reduces the number of infeasible combination (because only feasible synchronization sequences are generated), many synchronization combinations are also generated, and this again results in a testing cost with exponential behavior. This paper presents a new composite approach that uses reachability testing to guide the selection of the synchronization sequences tests according to a specific structural testing criterion. This new composite approach is empirically evaluated in the context of message-passing concurrent programs developed with MPI. The experimental study evaluates both the cost and effectiveness of proposed composite approach in comparison with traditional reachability testing and structural testing. The results confirm that the use of the new composite approach has advantages for testing of concurrent applications. Copyright © 2015 John Wiley & Sons, Ltd. KEY WORDS: structural testing; reachability testing; concurrent programs; experimental study INTRODUCTIONConcurrent software is being increasingly used with the availability of multicore processors and computer clusters. Many modern business applications now use concurrency to improve overall system performance. However, all concurrent software contains features, such as nondeterminism, synchronization, and interprocess communication, which make concurrent software significantly more complex than sequential software. These features impose new challenges for testing and increase the difficulty of demonstrating the correct execution of the application in all possible conditions. Traditional testing techniques are often not well-suited to the testing of concurrent (or parallel) software. Many researchers have developed specific testing techniques to address specific issues such as nondeterminism, concurrency, communication, synchronization, race conditions, and replay testing [1][2][3][4][5][6][7][8][9][10][11].In previous work, structural testing criteria for concurrent programs were proposed by Souza et al. [12], defining test models and tools to test message-passing software. This work was extended by Sarmanho et al. [13] to test shared-memory software. These structural testing criteria are designed to explore information about the control, data, and communication flows of concurrent programs, considering both their sequential and parallel aspects. These contributions are related to the coverage analysis concept, in which a coverage model is first defined, and then the model is evaluated during the execution of the program to determine whether th...

show abstract

“…Instead of deriving a sequence of path conditions from the sync-sequence obtained with the method, it performs statement-coverage testing. A formal proof demonstrates that there is a statement coverage if there is solution for all path conditions by the constraint solver, and the concurrent program contains no dead code (HWANG et al, 2014).…”

Section: Approaches For Testing Concurrent Programsmentioning

confidence: 99%

Structural testing criteria for concurrent programs considering loop execution

Diaz¹

View full text Add to dashboard Cite

Statement-Coverage Testing for Nondeterministic Concurrent Programs

Cited by 3 publications

References 3 publications

A systematic review of approaches for testing concurrent programs

A systematic review of approaches for testing concurrent programs

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

Structural testing criteria for concurrent programs considering loop execution

Contact Info

Product

Resources

About