Search-based software engineering for constructing covering arrays

被引：1

作者：

Torres-Jimenez, Jose ^{[1
]}

Izquierdo-Marquez, Idelfonso ^{[1
]}

Avila-George, Himer ^{[2
]}

机构：

[1] CINVESTAV Tamaulipas, Ciudad Victoria, Tamaulipas, Mexico

[2] Univ Guadalajara, Ctr Univ Valles, Ameca, Jalisco, Mexico

来源：

IET SOFTWARE | 2018年 / 12卷 / 04期

关键词：

software engineering; program testing; optimisation; combinatorial mathematics; search problems; test cases; optimisation methods; software engineering problems; software testing stage; test suites; covering arrays; search-based software engineering; software system testing; search-based software testing algorithm; combinatorial structure; TEST SUITE GENERATION; TABU SEARCH; GENETIC ALGORITHM; VECTORS; SYSTEM;

D O I：

10.1049/iet-sen.2018.5141

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Search-based software engineering involves the application of optimisation methods to solve software engineering problems. One of the most significant difficulties in testing software systems is the effort needed to build the test suites required to validate a software system, which efficiently exposes faults. Given the importance of the software testing stage, a specific sub-area known as search-based software testing has become relevant in recent years. In this work, a search-based software testing algorithm for constructing covering arrays is proposed. A covering array is a combinatorial structure that can be used as a set of test cases. By utilising this algorithm, the authors reduce the size of 893 test suites.

引用

页码：324 / 332

页数：9

共 41 条

[1] Achievement of minimized combinatorial test suite for configuration-aware software functional testing using the Cuckoo Search algorithm [J].

Ahmed, Bestoun S. ;

Abdulsamad, Taib Sh. ;

Potrus, Moayad Y. .

INFORMATION AND SOFTWARE TECHNOLOGY, 2015, 66 :13-29

[2]

[Anonymous], J NETWORK INFORM SEC

[3]

Avila George H., 2012, MATH PROBL ENG, V2012, P19

[4] ABC-CAG: Covering Array Generator for Pair-wise Testing Using Artificial Bee Colony Algorithm [J].

Bansal, Priti ;

Sabharwal, Sangeeta ;

Mittal, Nitish ;

Arora, Sarthak .

E-INFORMATICA SOFTWARE ENGINEERING JOURNAL, 2016, 10 (01) :9-29

[5]

Bao X., 2015, INT J HYBRID INF TEC, V8, P121, DOI [10.14257/ijhit.2015.8.9.13., DOI 10.14257/IJHIT.2015.8.9.13]

[6]

Bryce RC, 2007, GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, P1082

[7] ORTHOGONAL ARRAYS OF INDEX UNITY [J].

BUSH, KA .

ANNALS OF MATHEMATICAL STATISTICS, 1952, 23 (03) :426-434

[8] Building Prioritized Pairwise Interaction Test Suites with Ant Colony Optimization [J].

Chen, Xiang ;

Gu, Qing ;

Zhang, Xin ;

Chen, Daoxu .

2009 NINTH INTERNATIONAL CONFERENCE ON QUALITY SOFTWARE (QSIC 2009), 2009, :347-352

[9] The AETG system: An approach to testing based on combinatorial design [J].

Cohen, DM ;

Dalal, SR ;

Fredman, ML ;

Patton, GC .

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1997, 23 (07) :437-444

[10] Constructing test suites for interaction testing [J].

Cohen, MB ;

Gibbons, PB ;

Mugridge, WB ;

Colbourn, CJ .

25TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, PROCEEDINGS, 2003, :38-48

← 1 2 3 4 5 →