All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Prioritized Process Test: An Alternative to Current Process Testing Strategies

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00332629" target="_blank" >RIV/68407700:21230/19:00332629 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1142/S0218194019500335" target="_blank" >https://doi.org/10.1142/S0218194019500335</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1142/S0218194019500335" target="_blank" >10.1142/S0218194019500335</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Prioritized Process Test: An Alternative to Current Process Testing Strategies

  • Original language description

    Testing processes and workflows in information and Internet of Things systems is a major part of the typical software testing effort. Consistent and efficient path-based test cases are desired to support these tests. Because certain parts of software system workflows have a higher business priority than others, this fact has to be involved in the generation of test cases. In this paper, we propose a Prioritized Process Test (PPT), which is a model-based test case generation algorithm that represents an alternative to currently established algorithms that use directed graphs and test requirements to model the system under test. The PPT accepts a directed multigraph as a model to express priorities, and edge weights are used instead of test requirements. To determine the test-coverage level of test cases, a test-depth-level concept is used. We compared the presented PPT with five alternatives (i.e. the Process Cycle Test (PCT), a naive reduction of test set created by the PCT, Brute Force algorithm, Set-covering-Based Solution and Matching-based Prefix Graph Solution) for edge coverage and edge-pair coverage. To assess the optimality of the path-based test cases produced by these strategies, we used 14 metrics based on the properties of these test cases and 59 models that were created for three real-world systems. For all edge coverage, the PPT produced more optimal test cases than the alternatives in terms of the majority of the metrics. For edge-pair coverage, the PPT strategy yielded similar results to those of the alternatives. Thus, the PPT strategy is an applicable alternative as it reflects both the required test coverage level and the business priority in parallel.

  • 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

    International Journal of Software Engineering and Knowledge Engineering

  • ISSN

    0218-1940

  • e-ISSN

    1793-6403

  • Volume of the periodical

    29

  • Issue of the periodical within the volume

    7

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    32

  • Pages from-to

    997-1028

  • UT code for WoS article

    000479114500005

  • EID of the result in the Scopus database

    2-s2.0-85070308581