In this paper, we present a new framework for performing dynamic testing of semaphore-based and shared-memory concurrentprograms. The proposed scheme only has to analyse the synchronization sequences (SYN-sequences) ...
详细信息
In this paper, we present a new framework for performing dynamic testing of semaphore-based and shared-memory concurrentprograms. The proposed scheme only has to analyse the synchronization sequences (SYN-sequences) that are collected during the dynamic testing of the concurrentprogram - static analysis of the syntax and semantics of the target concurrentprogram is unnecessary. A model checker is not needed to explore the feasible interleavings of the execution of the concurrentprogram. If the number of feasible SYN-sequences of the tested concurrentprogram is finite, our scheme can perform dynamic testing of all the feasible SYN-sequences. If the tested concurrentprogram has an infinite number of SYN-sequences, state-cover testing of the target program can be performed (if the execution states of the target concurrentprogram are finite). The implementation and experimental results obtained with real codes and some benchmark programs demonstrate the feasibility of the proposed scheme. Copyright (c) 2014 John Wiley & Sons, Ltd.
暂无评论