The study of the sequential inclusion of paths in the analysis of program code for the task of selecting input test data : доклад, тезисы доклада

Описание

Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций

Конференция: International Conference on Data Analytics and Management in Data Intensive Domains, DAMDID/RCDL 2020; Voronezh; Voronezh

Год издания: 2020

Ключевые слова: Code Coverage, Control Flow Graph, fitness function, genetic algorithm, optimization method, program code, test data, test data generation, testing process

Аннотация: The article proposes the results of a study evaluating one and many paths of program code, the work is not finished yet. To solve the problem of generating data sets, it is proposed to use a genetic algorithm for determining the complexity of program code for many paths. The proposed method allows to generate data for multiple codeПоказать полностьюpaths by sequentially eliminating operations to achieve maximum possible code coverage. For each generated data set the operations on the path are excluded from following generation, which allows generating new sets along other paths. The article describes the results of this method with a description of the data generation method and analysis of the generated data sets for many paths.

Ссылки на полный текст

Издание

Журнал: CEUR Workshop Proceedings

Выпуск журнала: 2790

Номера страниц: 79-88

Персоны

  • Serdyukov K.E. (Novosibirsk State Technical University)
  • Avdeenko T.V. (Novosibirsk State Technical University)

Вхождение в базы данных