Employment of Multiple Algorithms for Optimal Path-based Test Selection Strategy

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Employment of Multiple Algorithms for Optimal Path-based Test Selection Strategy

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Employment of Multiple Algorithms for Optimal Path-based Test Selection Strategy

Popis výsledku anglicky

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.

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

<a href="/cs/project/TH02010296" target="_blank" >TH02010296: Zajištění kvality pro technologii Internet of Things</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2019

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

Information and Software Technology

ISSN

0950-5849

e-ISSN

1873-6025

Svazek periodika

114

Číslo periodika v rámci svazku

October

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

16

Strana od-do

21-36

Kód UT WoS článku

000480669200002

EID výsledku v databázi Scopus

2-s2.0-85067596031