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”

Multi-objective Genetic Optimization for Noise-Based Testing of Concurrent Software

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F14%3APU112027" target="_blank" >RIV/00216305:26230/14:PU112027 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-09940-8_8" target="_blank" >http://dx.doi.org/10.1007/978-3-319-09940-8_8</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-09940-8_8" target="_blank" >10.1007/978-3-319-09940-8_8</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Multi-objective Genetic Optimization for Noise-Based Testing of Concurrent Software

  • Original language description

    Testing of multi-threaded programs is a~demanding work due to the many possible thread interleavings one should examine. The noise injection technique helps to increase the number of thread interleavings examined during repeated test executions provided that a~suitable setting of noise injection heuristics is used. The problem of finding such a~setting, i.e., the so called test and noise configuration search problem (TNCS problem), is not easy to solve. In this paper, we show how to apply a~multi-objective genetic algorithm (MOGA) to the TNCS problem. In particular, we focus on generation of TNCS solutions that cover a~high number of distinct interleavings (especially those which are rare) and provide stable results at the same time. To achieve this goal, we study suitable metrics and ways how to suppress effects of non-deterministic thread scheduling on the proposed MOGA-based approach. We also discuss a~choice of a~concrete MOGA and its parameters suitable for our setting.  Finally, we show on a~set of benchmark programs that our approach provides better results when compared to the commonly used random approach as well as to the sooner proposed use of a~single-objective genetic approach.

  • 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

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2014

  • 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

    SSBSE'14

  • ISBN

    978-3-319-09939-2

  • ISSN

  • e-ISSN

  • Number of pages

    16

  • Pages from-to

    107-122

  • Publisher name

    Springer Verlag

  • Place of publication

    Heidelberg

  • Event location

    Fortaleza, Aquiraz, Ceará, Brasil

  • Event date

    Aug 26, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000345519200008