2016
DOI: 10.1016/j.infsof.2016.04.013
|View full text |Cite
|
Sign up to set email alerts
|

RGA: A lightweight and effective regeneration genetic algorithm for coverage-oriented software test data generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
19
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(21 citation statements)
references
References 16 publications
1
19
0
Order By: Relevance
“…The suggested improvements involved presenting a new technique to order the program code branches, for being selected as the coverage goals, transferring a maximum of 10 percent of the desired elements of each generation to the next generation, and storing several generated population's elements for a branch into a generated initial population of the sibling branch. Yang et al [16] proposed a new search-based method for test data generation, called the regenerate genetic algorithm (RGA). RGA adds a new regeneration strategy to the traditional GA, which enables it to avoid the possible local stagnation.…”
Section: Search-based Methods For Test Data Generation In Sequential mentioning
confidence: 99%
“…The suggested improvements involved presenting a new technique to order the program code branches, for being selected as the coverage goals, transferring a maximum of 10 percent of the desired elements of each generation to the next generation, and storing several generated population's elements for a branch into a generated initial population of the sibling branch. Yang et al [16] proposed a new search-based method for test data generation, called the regenerate genetic algorithm (RGA). RGA adds a new regeneration strategy to the traditional GA, which enables it to avoid the possible local stagnation.…”
Section: Search-based Methods For Test Data Generation In Sequential mentioning
confidence: 99%
“…For example, applying a GA for test case generation corresponds with du-path coverage to execute all paths where variables are defined and used [8]. GAs have been applied to evaluate test cases to satisfy mutation testing [9] and used to generate test cases in accordance with branch coverage [10][11][12][13].…”
Section: Motivation and Related Workmentioning
confidence: 99%
“…GAs have been used by researchers to generate test cases during software development [12,[17][18][19]. GAs utilize chromosomes that represent test cases or a set of test data.…”
Section: Test Case Generation Using Gasmentioning
confidence: 99%
“…Experiment results show that suggested approach performs better than simple path coverage. Yang et al [5] used a modified GA called regenerate genetic algorithm (RGA), which solves the population aging problem of the basic genetic algorithm. This algorithm regenerates population when population aging crosses the threshold limit.…”
Section: A Ga In Structural Testingmentioning
confidence: 99%