An Efficient Algorithm for Pairwise Test Case Generation in Presence of Constraints

被引：0

作者：

Gao, Shiwei ^{[1
]}

Du, Binglei ^{[1
]}

Jiang, Yaruo ^{[1
]}

Lv, Jianghua ^{[1
]}

Ma, Shilong ^{[1
]}

机构：

[1] Beihang Univ, State Key Lab Software Dev Environm, Beijing 100191, Peoples R China

来源：

2014 2ND INTERNATIONAL CONFERENCE ON SYSTEMS AND INFORMATICS (ICSAI) | 2014年

关键词：

Combinational testing; IPO_SAT; Constraints handling; Forbidden tuples;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Constraints handling problem in combinational testing is an intensive computation process. In this paper, we present an effective algorithm, called IPO_SAT (In-Parameter-Order-Satisfiability), for pairwise test case generation in presence of constraints. In our strategy, constraints are denoted as forbidden tuples, which are converted to conjunctive normal form. Then, the combination test cases which meet the constraints are found out by calling Boolean satisfiability(SAT) solvers. Besides, an optimization upon the process is given, in order to improve the performance of IPO_SAT by reducing the number of times of calling SAT solver and avoiding checking irrelevant constraints. Finally, experimental results show that the proposed IPO_SAT algorithm is efficient and the optimization has obvious improvements on reducing time cost.

引用

页码：406 / 410

页数：5

共 50 条

[21] New label propagation algorithm with pairwise constraints
Bai, Liang
Wang, Junbin
Liang, Jiye
Du, Hangyuan
PATTERN RECOGNITION, 2020, 106
[22] A test generation strategy for pairwise testing
Tai, KC
Lei, Y
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2002, 28 (01) : 109 - 111
[23] The Algorithm to Solve Equation Constraints in Automatic Test Data Generation
1740, Institute of Computing Technology (29):
[24] Using Satisfiability Solving for Pairwise Testing in the Presence of Constraints
Nanba, Toru
Tsuchiya, Tatsuhiro
Kikuno, Tohru
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2012, E95A (09) : 1501 - 1505
[25] PhABC: A Hybrid Artificial Bee Colony Strategy for Pairwise test suite Generation with Constraints Support
Alazzawi, Ammar K.
Rais, Helmi Md
Basri, Shuib
Alsariera, Yazan A.
2019 17TH IEEE STUDENT CONFERENCE ON RESEARCH AND DEVELOPMENT (SCORED), 2019, : 106 - 111
[26] PS2Way: An Efficient Pairwise Search Approach for Test Data Generation
Khatun, Sabira
Rabbi, Khandakar Fazley
Yaakub, Che Yahaya
Klaib, M. F. J.
Ahmed, Mohammad Masroor
SOFTWARE ENGINEERING AND COMPUTER SYSTEMS, PT 3, 2011, 181 : 99 - +
[27] Combining genetic algorithm and pairwise testing for optimised test generation from UML ADs
Anbunathan, R.
Basu, Anirban
IET SOFTWARE, 2019, 13 (05) : 423 - 433
[28] Efficient test generation algorithm for path delay faults
Kim, MG
Kang, SH
ELECTRONICS LETTERS, 2000, 36 (01) : 13 - 14
[29] An Efficient Algorithm for Constraint Handling in Combinatorial Test Generation
Yu, Linbin
Lei, Yu
Nourozborazjany, Mehra
Kacker, Raghu N.
Kuhn, D. Richard
2013 IEEE SIXTH INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION (ICST 2013), 2013, : 242 - 251
[30] An Efficient Critical Path Generation Algorithm Considering Extensive Path Constraints
Guo, Guannan
Huang, Tsung-Wei
Lin, Chun-Xun
Wong, Martin
PROCEEDINGS OF THE 2020 57TH ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2020,

← 1 2 3 4 5 →