Research on the Pairwise Test Case Generation of Two-Dimensional Expansion

DOI

10.2991/citcs.2012.217How to use a DOI?

Keywords

combinatorial interaction testing; IPO_S_R; restriction; 2-dimensional expansion

Abstract

The recently widely-spreading usage of combinatorial interaction testing is dramatically improving the effectiveness of highly-configurable software. Conventional techniques based on greedy or heuristic algorithms can lead to suboptimal result in the size of the built test suite with unstability. In this paper, a strategy for the construction of pairwise covering test cases is presented on the basis of research on previous 2-dimensional expansion algorithm to eliminate randomness and optimize efficiency that caused by itself. The proposed approach IPO_S_R is supported by symmetry property and lower bound theory. In addition, experimental assessment is also presented

Copyright

© 2012, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Shuai Yuan
AU  - Gang Ye
AU  - Jingyan Cui
AU  - Shilong Ma
PY  - 2012/11
DA  - 2012/11
TI  - Research on the Pairwise Test Case Generation of Two-Dimensional Expansion
BT  - Proceedings of the 2012 National Conference on Information Technology and Computer Science
PB  - Atlantis Press
SP  - 854
EP  - 857
SN  - 1951-6851
UR  - https://doi.org/10.2991/citcs.2012.217
DO  - 10.2991/citcs.2012.217
ID  - Yuan2012/11
ER  -