Employment of Multiple Algorithms for Optimal Path-based Test Selection Strategy
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00332689" target="_blank" >RIV/68407700:21230/19:00332689 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.infsof.2019.06.006" target="_blank" >https://doi.org/10.1016/j.infsof.2019.06.006</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.infsof.2019.06.006" target="_blank" >10.1016/j.infsof.2019.06.006</a>
Alternative languages
Result language
angličtina
Original language name
Employment of Multiple Algorithms for Optimal Path-based Test Selection Strategy
Original language description
Executing various sequences of system functions in a system under test represents one of the primary techniques in software testing. The natural method for creating effective, consistent and efficient test sequences is to model the system under test and employ an algorithm to generate tests that satisfy a defined test coverage criterion. Several criteria for preferred test set properties can be defined. In addition, to optimize the test set from an economic viewpoint, the priorities of the various parts of the system model under test must be defined. Objective: Using this prioritization, the test cases exercise the high-priority parts of the system under test by more path combinations than those with low priority (this prioritization can be combined with the test coverage criterion that determines how many path combinations of the individual parts of the system are tested). Evidence from the literature and our observations confirm that finding a universal algorithm that produces a test set with preferred properties for all test coverage criteria is a challenging task. Moreover, for different individual problem instances, different algorithms provide results with the best value of a preferred property. In this paper, we present a portfolio-based strategy to perform the best test selection. Method: The proposed strategy first employs a set of current algorithms to generate test sets; then, a preferred property of each test set is assessed in terms of the selected criterion, and finally, the test set with the best value of a preferred property is chosen.
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
<a href="/en/project/TH02010296" target="_blank" >TH02010296: Quality Assurance System for Internet of Things Technology</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2019
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
Information and Software Technology
ISSN
0950-5849
e-ISSN
1873-6025
Volume of the periodical
114
Issue of the periodical within the volume
October
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
16
Pages from-to
21-36
UT code for WoS article
000480669200002
EID of the result in the Scopus database
2-s2.0-85067596031