This paper presents a framework of the distributed concurrent multi-port-testing test system (CMPT-TS) for IP routers under development at Sichuan Network Communication Key Laboratory. Having analyzed the actuality of...This paper presents a framework of the distributed concurrent multi-port-testing test system (CMPT-TS) for IP routers under development at Sichuan Network Communication Key Laboratory. Having analyzed the actuality of concurrent testing for routers, this paper develops a distributed architecture of CMPT-TS and discusses its functional components in detail. Moreover, a new test definition language, CMPT definition language, is also introduced simply.展开更多
Reachability testing is an approach to testing concurrent programs, which can systematically exercise every partially ordered SYN-sequence without constructing the static model. In fact, not all the SYN-sequences need...Reachability testing is an approach to testing concurrent programs, which can systematically exercise every partially ordered SYN-sequence without constructing the static model. In fact, not all the SYN-sequences need to be tested. This paper proposed a SYN-sequence selection strategy for reachability testing, which can reduce the number of SYN-sequences generated without decreasing the effectiveness of detecting programs＇ errors. We described a simple algorithm to implement the strategy, and then discussed several optimizations to the algorithm. Experiments have been carried out in a case study to verify the efficacy of the strategy.展开更多
This paper defines a new relation--little strong happened-before（LSHB） and presents the algorithm for LSHB. Compared with strong happened-before （SHB） and weak happened- before （WHB）, LSHB supports keeping-read-...This paper defines a new relation--little strong happened-before（LSHB） and presents the algorithm for LSHB. Compared with strong happened-before （SHB） and weak happened- before （WHB）, LSHB supports keeping-read-result and ensures definite sufficiency of testing. Equivalence partitioning the set of SYN-sequences based on LSHB can efficiently reduce the number of testing SYN-sequences. The case studies prove that LSHB has high practicability.展开更多
This study proposes a recoverable stress testing algorithm （RSTA） for such special devices as compression/decompression card and encryption/deeryption card. It uses a chaos function to generate a random sequence, an...This study proposes a recoverable stress testing algorithm （RSTA） for such special devices as compression/decompression card and encryption/deeryption card. It uses a chaos function to generate a random sequence, and then, according to the random sequence, generates an effective command sequence. The dispatch of command obeys a special schedule strategy we designed for such devices, i.e., the commands are sent according to the command sequence, and the complete commands are put in a buffer for further result check. RSTA is used to test the HIFN compression acceleration card SAICHI-1000. Test results show that RSTA can make the card work continuously and adequately.展开更多
Reachability testing is an important approach to testing concurrent programs. It generates and exercises syn- chronization sequences automatically and on-the-fly without saving any test history. Existing reach, abilit...Reachability testing is an important approach to testing concurrent programs. It generates and exercises syn- chronization sequences automatically and on-the-fly without saving any test history. Existing reach, ability testing can be classified into exhaustive and t-way testing. Exhaustive testing is impractical in many cases whilie t-way testing may decrease the capability of fault detection in some cases. In this paper, we present a variable strengda reachability testing strategy, which adopts the dynamic framework of reachability testing and uses a variable strength combinatorial strategy. Different parameter groups are provided with different covering strength. Variable strength testing covers no t-way combinations but the necessary combinations of parameters having mutual interactions in a concurrent program. It is more reasonable than t-way testing because uniform interactions between parameters do not often exist in concurrent systems. We propose a merging algorithm that implements the variable strength combinatorial testing strategy and conduct our experiment on several concurrent programs. The experimental results indicate that our variable strength reachability testing reaches a good tradeoff between the effectiveness and efficiency. It can keep the same capability of fault detection as exhaustive reachability testing while substantially reducing the number of synchronization sequences and decreasing the execution time in most cases.展开更多
The basis of distributed system conformance testing is to test theconformance of each entity with its standard. This paper addresses the approach toentity conformance testing based on concurrent TTCN. First a prelimin...The basis of distributed system conformance testing is to test theconformance of each entity with its standard. This paper addresses the approach toentity conformance testing based on concurrent TTCN. First a preliminary framework for entity conformance testing is introduced and a specification model CEBEis presented. Then a test generation method, which could directly derive concurrentTTCN test suite from CEBE, is proposed.展开更多
文摘This paper presents a framework of the distributed concurrent multi-port-testing test system (CMPT-TS) for IP routers under development at Sichuan Network Communication Key Laboratory. Having analyzed the actuality of concurrent testing for routers, this paper develops a distributed architecture of CMPT-TS and discusses its functional components in detail. Moreover, a new test definition language, CMPT definition language, is also introduced simply.
基金Supported by the "Tenth-Five Years" National Science Pre-Research Foundation of China (41315.9.2)the Natural Science Founda-tion of Hubei Province (2005ABA266)
文摘Reachability testing is an approach to testing concurrent programs, which can systematically exercise every partially ordered SYN-sequence without constructing the static model. In fact, not all the SYN-sequences need to be tested. This paper proposed a SYN-sequence selection strategy for reachability testing, which can reduce the number of SYN-sequences generated without decreasing the effectiveness of detecting programs＇ errors. We described a simple algorithm to implement the strategy, and then discussed several optimizations to the algorithm. Experiments have been carried out in a case study to verify the efficacy of the strategy.
基金Supported by the National Pre-research Foundation Project of China (513150402)
文摘This paper defines a new relation--little strong happened-before（LSHB） and presents the algorithm for LSHB. Compared with strong happened-before （SHB） and weak happened- before （WHB）, LSHB supports keeping-read-result and ensures definite sufficiency of testing. Equivalence partitioning the set of SYN-sequences based on LSHB can efficiently reduce the number of testing SYN-sequences. The case studies prove that LSHB has high practicability.
基金the Hi-Tech Research and Development Pro-gram (863) of China (No. 2006AA01Z431)the Giant Project of Zhejiang Province, China (No. 2006C11105)
文摘This study proposes a recoverable stress testing algorithm （RSTA） for such special devices as compression/decompression card and encryption/deeryption card. It uses a chaos function to generate a random sequence, and then, according to the random sequence, generates an effective command sequence. The dispatch of command obeys a special schedule strategy we designed for such devices, i.e., the commands are sent according to the command sequence, and the complete commands are put in a buffer for further result check. RSTA is used to test the HIFN compression acceleration card SAICHI-1000. Test results show that RSTA can make the card work continuously and adequately.
文摘Reachability testing is an important approach to testing concurrent programs. It generates and exercises syn- chronization sequences automatically and on-the-fly without saving any test history. Existing reach, ability testing can be classified into exhaustive and t-way testing. Exhaustive testing is impractical in many cases whilie t-way testing may decrease the capability of fault detection in some cases. In this paper, we present a variable strengda reachability testing strategy, which adopts the dynamic framework of reachability testing and uses a variable strength combinatorial strategy. Different parameter groups are provided with different covering strength. Variable strength testing covers no t-way combinations but the necessary combinations of parameters having mutual interactions in a concurrent program. It is more reasonable than t-way testing because uniform interactions between parameters do not often exist in concurrent systems. We propose a merging algorithm that implements the variable strength combinatorial testing strategy and conduct our experiment on several concurrent programs. The experimental results indicate that our variable strength reachability testing reaches a good tradeoff between the effectiveness and efficiency. It can keep the same capability of fault detection as exhaustive reachability testing while substantially reducing the number of synchronization sequences and decreasing the execution time in most cases.
文摘The basis of distributed system conformance testing is to test theconformance of each entity with its standard. This paper addresses the approach toentity conformance testing based on concurrent TTCN. First a preliminary framework for entity conformance testing is introduced and a specification model CEBEis presented. Then a test generation method, which could directly derive concurrentTTCN test suite from CEBE, is proposed.
