Article: An elitist-flower pollination-based strategy for constructing sequence and sequence-less t-way test suite Journal: International Journal of Bio-Inspired Computation (IJBIC) 2018 Vol.12 No.2 pp.115 - 127 Abstract: In line with the upcoming of a new field called search-based software engineering (SBSE), many newly developed t-way strategies adopting meta-heuristic algorithms can be seen in the literature for constructing interaction test suite (such as simulated annealing (SA), genetic algorithm (GA), ant colony optimisation algorithm (ACO), particle swarm optimisation (PSO), harmony search (HS) and cuckoo search (CS). Although useful, most of the aforementioned t-way strategies have assumed sequence-less interactions amongst input parameters. In the case of reactive system, such an assumption is invalid as some parameter operations (or events) occur in sequence and hence, creating a possibility of bugs triggered by the order (or sequence) of input parameters. If t-way strategies are to be adopted in such a system, there is also a need to support test data generation based on sequence of interactions. In line with such a need, this paper presents a unified strategy based on the new meta-heuristic algorithm, called the elitist flower pollination algorithm (eFPA), for sequence and sequence-less coverage. Experimental results demonstrate the proposed strategy gives sufficiently competitive results as compared with existing works. Inderscience Publishers - linking academia, business and industry through research

Title: An elitist-flower pollination-based strategy for constructing sequence and sequence-less t-way test suite

Authors: Abdullah B. Nasser; Kamal Z. Zamli; AbdulRahman A. Alsewari; Bestoun S. Ahmed

Addresses: Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang, 26300 Kuantan, Pahang, Malaysia ' Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang, 26300 Kuantan, Pahang, Malaysia ' Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang, 26300 Kuantan, Pahang, Malaysia ' Faculty of Electrical Engineering, Department of Computer Science, Czech Technical University, Karlovo n'am, 13, 121 35, Praha 2, Czech Republic

Abstract: In line with the upcoming of a new field called search-based software engineering (SBSE), many newly developed t-way strategies adopting meta-heuristic algorithms can be seen in the literature for constructing interaction test suite (such as simulated annealing (SA), genetic algorithm (GA), ant colony optimisation algorithm (ACO), particle swarm optimisation (PSO), harmony search (HS) and cuckoo search (CS). Although useful, most of the aforementioned t-way strategies have assumed sequence-less interactions amongst input parameters. In the case of reactive system, such an assumption is invalid as some parameter operations (or events) occur in sequence and hence, creating a possibility of bugs triggered by the order (or sequence) of input parameters. If t-way strategies are to be adopted in such a system, there is also a need to support test data generation based on sequence of interactions. In line with such a need, this paper presents a unified strategy based on the new meta-heuristic algorithm, called the elitist flower pollination algorithm (eFPA), for sequence and sequence-less coverage. Experimental results demonstrate the proposed strategy gives sufficiently competitive results as compared with existing works.

Keywords: t-way testing; flower pollination algorithm; event sequence testing; combinatorial problem; meta-heuristics; optimisation problem.

DOI: 10.1504/IJBIC.2018.094223

International Journal of Bio-Inspired Computation, 2018 Vol.12 No.2, pp.115 - 127

Accepted: 02 Feb 2018
Published online: 22 Aug 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: An elitist-flower pollination-based strategy for constructing sequence and sequence-less t-way test suite

Keep up-to-date