Normal view MARC view ISBD view

A bat-inspired t-way strategy for mixed-strength test suite generation / Yazan Ahmad Sadeq Al Sariera

By:

Ahmad, Yazan Sadeq Al Sariera [author.]

Material type: Text

text
text

Media type:

unmediated
computer

Carrier type:

volume
computer disc

ISBN:

THE0001288(Local)

Subject(s):

Dissertation note: Thesis (Doctor of Philosophy) -- Universiti Malaysia Pahang – 2017 Abstract: Software testing is essential part of software development life cycle. Yet, exhaustive testing of highly configurable software is impractical owing to the limited time and resources. Furthermore, exhaustive testing leads to a combinatorial explosion problem whereby the test cases grow exponentially with the increase of software inputs. Owing to its effectiveness for bug finding, many researchers are turning to the sampling strategies based on input interaction, called t-way testing, where t indicates the interaction strength. Known to be an NP-complete (i.e. Non-deterministic Polynomial-time) problem, the process of minimizing t-way test cases is challenging owing to the potentially large generated search space when dealing with large input values. To date, many t-way strategies have been proposed in the literature. Recently, researchers have advocated the adoption of meta-heuristic based t-way strategies in line with the emergence of the new field called Search Based Software Engineering (SBSE). Although helpful, no single meta-heuristic based t-way strategies can claim dominance over their other counterparts. For this reason, the search for a new meta-heuristic based t-way strategy is still a useful endeavor. This thesis presents the design and implementation of a new meta-heuristic based t-way strategy, called Bat-inspired t-way Strategy (BTS), for generating a mixed-strength t-way test suite. BTS is the first t-way strategy that adopts the Bat-inspired algorithm as its core implementation and adopts the Hamming distance as the final selection criteria to enhance the exploration of new solution. The experimental results supported by non-parametric statistical analysis demonstrate that BTS gives competitive performance over its counterparts. Specifically, BTS has achieved and matched 68.181% of the best sizes from the published benchmark results with 32.575 % new known best sizes. This finding contributes to the field of software testing by minimizing the number of test cases for test execution.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 4 )

Holdings
Item type	Current library	Call number	Copy number	Status	Date due	Barcode
Thesis	UMPLIB PEKAN	FSKKP .Y39 2017 r Thesis (Browse shelf(Opens below))	1	Not for loan		0000122548
Thesis	UMPLIB PEKAN	CD 11224 \| FSKKP .Y39 2017 r Thesis (Browse shelf(Opens below))	1	Not for loan		0000122549

Faculty of Computer Systems and Software Engineering

Thesis (Doctor of Philosophy) -- Universiti Malaysia Pahang – 2017

Includes bibliographical references

Software testing is essential part of software development life cycle. Yet, exhaustive testing of highly configurable software is impractical owing to the limited time and resources. Furthermore, exhaustive testing leads to a combinatorial explosion problem whereby the test cases grow exponentially with the increase of software inputs. Owing to its effectiveness for bug finding, many researchers are turning to the sampling strategies based on input interaction, called t-way testing, where t indicates the interaction strength. Known to be an NP-complete (i.e. Non-deterministic Polynomial-time) problem, the process of minimizing t-way test cases is challenging owing to the potentially large generated search space when dealing with large input values. To date, many t-way strategies have been proposed in the literature. Recently, researchers have advocated the adoption of meta-heuristic based t-way strategies in line with the emergence of the new field called Search Based Software Engineering (SBSE). Although helpful, no single meta-heuristic based t-way strategies can claim dominance over their other counterparts. For this reason, the search for a new meta-heuristic based t-way strategy is still a useful endeavor. This thesis presents the design and implementation of a new meta-heuristic based t-way strategy, called Bat-inspired t-way Strategy (BTS), for generating a mixed-strength t-way test suite. BTS is the first t-way strategy that adopts the Bat-inspired algorithm as its core implementation and adopts the Hamming distance as the final selection criteria to enhance the exploration of new solution. The experimental results supported by non-parametric statistical analysis demonstrate that BTS gives competitive performance over its counterparts. Specifically, BTS has achieved and matched 68.181% of the best sizes from the published benchmark results with 32.575 % new known best sizes. This finding contributes to the field of software testing by minimizing the number of test cases for test execution.