A Method of Testing Generation Based on Prioritized Pair

Yu Wang; Hao Wu; Zhen Yu Sheng

doi:10.4028/www.scientific.net/AMM.241-244.2696

Paper Titles

Digital Halftoning Based on Clustering Analysis and Weighted Least Squares
p.2676

Research on Software Fault Diagnosis System Based on Multi-Agent Architecture
p.2681

The Construction of Intelligent Recording and Broadcasting System of Streaming Media Courseware
p.2685

JSSlicer: A Static Program Slicing Tool for JavaScript
p.2690

A Method of Testing Generation Based on Prioritized Pair
p.2696

A Preliminary Study on Software Architecture Evolution in Agile Development Process
p.2701

Software Engineering Analysis and Practice of Information System
p.2709

Design of Human Machine Interface Based on ARM and Linux
p.2714

The Quantified Evaluation Method of Project Test Based on Multi-Computing
p.2718

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 241-244A Method of Testing Generation Based on...

A Method of Testing Generation Based on Prioritized Pair

Abstract:

Combinatorial testing has lots of test cases, but software testers hope to get the best test coverage with the smallest test case suite. For the scale of produced test cases is so large that researchers have considered the implementation of the critical test cases. This article researches the classic combinatorial test methods and proposes methods to generate pair-wise testing cases with a priority. Firstly, we design formulas to compute the weights of priorities. Secondly, we adopt a greed algorithm to solve the combinatorial testing problems. Furthermore, we integrate the greed strategy into a genetic algorithm to improve the efficiency. It improves the testing efficiency while securing the detection rate of defects under limited resources.

You might also be interested in these eBooks

Industrial Instrumentation and Control Systems

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 241-244)

Pages:

2696-2700

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.241-244.2696

Citation:

Cite this paper

Online since:

December 2012

Authors:

Yu Wang, Hao Wu, Zhen Yu Sheng

Keywords:

Combinatorial Test, Component, Genetic Algorithm (GA), Software Test

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Kuhn DR, Reilly MJ, An investigation of the applicability of design of experiments to software testing. In: Caulfield M, ed. Proc.of the Annual NASA/IEEE (SEW). Los Alamitos: IEEE Press, 2002.

DOI: 10.1109/sew.2002.1199454

Google Scholar

[2] Jun YAN, Jian ZHANG, [J].Journal of Software, 2009, 20(6):1393-1405.(In Chinese)

Google Scholar

[3] Jianfeng LIAO, Xiantao CAI, [J].Computer Engineering and Applications, 2012, 48(11): 65-70.(In Chinese)

Google Scholar

[4] Nurmela KJ, Upper bounds for covering arrays by tabu search. Discrete Applied Mathematics, 2004, 138(9):143-152.

DOI: 10.1016/s0166-218x(03)00291-9

Google Scholar

[5] Xiang CHEN, Qing GU, Xinping WANG, Daoxu CHEN, [J].Computer Science, 2010, 37(3):1-5.(In Chinese)

Google Scholar

[6] Mats Grindal,Birgitta Lindstrom, Jeff Offutt, Sten FAndler, An evaluation of combination strategies for test case selection. Empirical Software Engineering, 2006, 583-611.

DOI: 10.1007/s10664-006-9024-2

Google Scholar

[7] Lei Y, Kacker R, Kuhn DR, Okun V, Lawrence J. IPOG: A general strategy for t-way software testing. In: Leaney J, O'Neill T,Peng J, eds. Proc. of the Annual IEEE Int'l Conf. and Workshops on the Engineering of Computer-Based Systems (ECBS). LosAlamitos: IEEE Press, 2007, 549-556.

DOI: 10.1109/ecbs.2007.47

Google Scholar