A model‐free and state‐cover testing scheme for semaphore‐based and shared‐memory concurrent programs. (13th January 2014)

• Record Type: Journal Article
• Authors: Hwang, Gwan‐Hwan; Lin, Che‐Sheng; Lee, Teng‐Shuo; Wu‐Lee, Chi; Brucker, Achim D.; Julliand, Jacques
• Is Part Of: Software testing, verification & reliability. Volume 24:Number 8(2014)
• Page Start: 706
• Page End: 737
• Publication Date: 2014-01-13
• Subjects: Computer software -- Testing -- Periodicals; Computer software -- Verification -- Periodicals; Computer software -- Reliability -- Periodicals; 005.14
• DOI: 10.1002/stvr.1520
• Languages: English
• ISSNs: 0960-0833

Abstract

<abstract abstract-type="main" id="stvr1520-abs-0001"> <title>SUMMARY</title> <p id="stvr1520-para-0001">In this paper, we present a new framework for performing dynamic testing of semaphore‐based and shared‐memory concurrent programs. The proposed scheme only has to analyse the synchronization sequences (SYN‐sequences) that are collected during the dynamic testing of the concurrent program – static analysis of the syntax and semantics of the target concurrent program is unnecessary. A model checker is not needed to explore the feasible interleavings of the execution of the concurrent program. If the number of feasible SYN‐sequences of the tested concurrent program is finite, our scheme can perform dynamic testing of all the feasible SYN‐sequences. If the tested concurrent program has an infinite number of SYN‐sequences, state‐cover testing of the target program can be performed (if the execution states of the target concurrent program are finite). The implementation and experimental results obtained with real codes and some benchmark programs demonstrate the feasibility of the proposed scheme. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>