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”

CPT Manager: An Open Environment for Constrained Path-Based Testing

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F25%3A00388273" target="_blank" >RIV/68407700:21230/25:00388273 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/ICSTW64639.2025.10962475" target="_blank" >https://doi.org/10.1109/ICSTW64639.2025.10962475</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ICSTW64639.2025.10962475" target="_blank" >10.1109/ICSTW64639.2025.10962475</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    CPT Manager: An Open Environment for Constrained Path-Based Testing

  • Original language description

    Path-based Testing is a common technique to test System Under Test (SUT) processes. Generally, a directed graph that models a system's workflow is input to the test path generation process, as well as the selected test coverage criterion. Several algorithms are proposed in the literature that traverse the graph and facilitate the generation of test cases for the selected coverage criterion. However, a plain directed graph used for modeling SUT processes does not allow for the capture of real-life dependencies and constraints between actions in the tested processes, which might pose a limit in application of this technique. Therefore, we defined an extended model that allows the specification of constraints upon the graph's elements and a set of algorithms that allow the generation of the set of test cases that satisfy the given constraints with the edge coverage. Considering the fact that in path-based testing, there is no platform in which engineers and researchers can share SUT models to be further assembled into open datasets to test performance of evolved path-based testing MBT algorithms, especially for the given problem of test paths generation with the constraints, this paper presents a summary of the problem and a novel management for creation and management of SUT models with constraints that allows the generation of test paths as well as to serve as a platform for creation of such benchmark datasets.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • 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/LUABA24101" target="_blank" >LUABA24101: DeepMBT: New Generation of Model-based Software Testing Using Artificial Intelligence</a><br>

  • Continuities

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

Others

  • Publication year

    2025

  • 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

  • Article name in the collection

    IEEE International Conference on Software Testing Verification and Validation Workshops

  • ISBN

    979-8-3315-3467-7

  • ISSN

    2159-4848

  • e-ISSN

  • Number of pages

    4

  • Pages from-to

    50-53

  • Publisher name

    IEEE Xplore

  • Place of publication

  • Event location

    Naples

  • Event date

    Mar 31, 2025

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    001483187700008