An Elitist-flower Pollination-based Strategy for Constructing Sequence and Sequence-less t-way Test Suite
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
An Elitist-flower Pollination-based Strategy for Constructing Sequence and Sequence-less t-way Test Suite
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
International Journal of Bio-Inspired Computation
ISSN
1758-0366
e-ISSN
1758-0374
Volume of the periodical
12
Issue of the periodical within the volume
2
Country of publishing house
GB - UNITED KINGDOM
Number of pages
13
Pages from-to
115-127
UT code for WoS article
000444104900003
EID of the result in the Scopus database
2-s2.0-85052702756