An Elitist-flower Pollination-based Strategy for Constructing Sequence and Sequence-less t-way Test Suite

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00322791" target="_blank" >RIV/68407700:21230/18:00322791 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1504/IJBIC.2018.10015522" target="_blank" >http://dx.doi.org/10.1504/IJBIC.2018.10015522</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1504/IJBIC.2018.10015522" target="_blank" >10.1504/IJBIC.2018.10015522</a>

Jazyk výsledku

angličtina

Název v původním jazyce

An Elitist-flower Pollination-based Strategy for Constructing Sequence and Sequence-less t-way Test Suite

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

An Elitist-flower Pollination-based Strategy for Constructing Sequence and Sequence-less t-way Test Suite

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

International Journal of Bio-Inspired Computation

ISSN

1758-0366

e-ISSN

1758-0374

Svazek periodika

12

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

13

Strana od-do

115-127

Kód UT WoS článku

000444104900003

EID výsledku v databázi Scopus

2-s2.0-85052702756