UMP Institutional Repository

Sequence and sequence-less T-way test suite generation strategy based on flower pollination algorithm

Abdullah, Nasser and Hujainah, Fadhl and Alsewari, Abdulrahman A. and Kamal Z., Zamli (2015) Sequence and sequence-less T-way test suite generation strategy based on flower pollination algorithm. In: IEEE Student Conference on Research and Development (SCOReD 2015), 13-14 December 2015 , Kuala Lumpur, Malaysia. pp. 676-680.. ISBN 978-146739572-4

[img] Pdf
Sequence and Sequence-Less T-way Test Suite.pdf
Restricted to Repository staff only

Download (709kB) | Request a copy

Abstract

In an attempt to ensure good-quality software, there is need to test all possible inputs. Owing to the fact that the exhaustive testing is hardly feasible, many software testing approaches has been proposed. Combinatorial Interaction Testing (CIT) is very promising technique to minimize the number of test cases. Although useful, most of exiting CIT strategies and tools focus on data inputs and assume “sequence-less” interactions between input parameters. However, reactive systems show sequence related behaviors and their faults may not expose if the sequence of inputs are not considered. In this paper, we propose a new t-way strategy (i.e. t refers to the degree of the combination) strategy, called Flower Strategy (FS), that addresses both sequence and sequence-less test generation. Experimental results show that FS produces test size.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Indexed by Scopus
Uncontrolled Keywords: Sequence-based T-way Testing, Flower pollination algorithm; Sequence test suite generation; Optimization problems.
Subjects: Q Science > QA Mathematics > QA76 Computer software
Faculty/Division: Faculty of Computer System And Software Engineering
Depositing User: Prof. Dr. Kamal Zuhairi Zamli
Date Deposited: 19 Jul 2018 06:34
Last Modified: 19 Jul 2018 06:34
URI: http://umpir.ump.edu.my/id/eprint/18260
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item