softwaretesting is one of the most important phases of the software development life cycle. However, softwaretesting is traditionally seen as a difficult and time consuming activity that is hard to embed in the soft...
详细信息
softwaretesting is one of the most important phases of the software development life cycle. However, softwaretesting is traditionally seen as a difficult and time consuming activity that is hard to embed in the software development process. software and hardware testers concentrate on how to minimize the testing time, as well as ensure that the system is also tested well and made acceptable. Basic combinatorial interaction (i.e. pairwise or 2-way) testing has been one of the commonly used methods in achieving the above goal with 50-97 percent of errors detection. However, empirical evidence has proved that the 2-way interaction testing is a poor strategy for testing highly interactive systems. Therefore there is a need for going beyond pairwise testing to uncover these errors. To speed up the process of solving problems, researchers have applied parallel algorithms to various large computationally expensive optimization problems and have succeeded in solving these problems in an acceptable time. Therefore, in this paper we have enhanced our previous strategy "A tree based strategy for test data generation and cost calculation for pairwise combinatorial interaction testing" to work effectively in parallel and to support a 3-way interaction testing. The correctness of the strategy has been proved, and the performance evaluation shows the efficient of the strategy in reducing test size. (C) 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/). Peer-review under responsibility of Universal Society for Applied Research
The test case construction is amongst the most labor-intensive tasks and has significant influence on the effectiveness and efficiency in softwaretesting. Due to the market needed for diverse types of tests, recently...
详细信息
ISBN:
(纸本)9789814585422;9789814585415
The test case construction is amongst the most labor-intensive tasks and has significant influence on the effectiveness and efficiency in softwaretesting. Due to the market needed for diverse types of tests, recently, several number of t-way testing strategies (where t indicates the interaction strengths) have been developed adopting different approaches Algebraic, Pure computational, and Optimization Algorithms (OpA). This paper presents an orchestrated survey of the existing OpA t-way strategies as Simulated Annealing (SA), Genetic Algorithm (GA), Ant Colony Algorithm (ACA), Particle Swarm Optimization based strategy (PSTG), and Harmony Search Strategy (HSS). The results demonstrate the strength and the limitations of each strategy, thereby highlighting possible research for future work in this area.
This paper deals with the tests of software and hardware for the "Landish" capsular endoscopic complex (CEC). The research is conducted to justify the expediency of manufacturing of this product and its use ...
详细信息
This paper deals with the tests of software and hardware for the "Landish" capsular endoscopic complex (CEC). The research is conducted to justify the expediency of manufacturing of this product and its use for the examination of the digestive tract. The complex effectively performs its functions and meets the requirements for its use. (C) 2018 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/3.0/) Peer-review under responsibility of the scientific committee of the 8th Annual International Conference on Biologically Inspired Cognitive Architectures
T-way strategy has been known to be effective in generating test data and addressed combinatorial explosion issue. This paper describes the design and development of a nondeterministic t-way strategy, called TTG, with...
详细信息
ISBN:
(纸本)9781467313117
T-way strategy has been known to be effective in generating test data and addressed combinatorial explosion issue. This paper describes the design and development of a nondeterministic t-way strategy, called TTG, with seeding and constraints support. In doing so, a number of experiments are discussed in order to prove the correctness of the implementation.
暂无评论