2019
DOI: 10.1504/ijbic.2019.101152
|View full text |Cite
|
Sign up to set email alerts
|

Markov approach for quantifying the software code coverage using genetic algorithm in software testing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Many problems in software engineering can be transformed into the combinatorial optimization problem. Thus, the genetic algorithm, which is simple and suitable for discrete problems, has been widely applied in software engineering [23][24][25][26][27][28]. Particularly, Mu [25] proposed a hybrid genetic algorithm-based strategy for software architecture re-modularization.…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…Many problems in software engineering can be transformed into the combinatorial optimization problem. Thus, the genetic algorithm, which is simple and suitable for discrete problems, has been widely applied in software engineering [23][24][25][26][27][28]. Particularly, Mu [25] proposed a hybrid genetic algorithm-based strategy for software architecture re-modularization.…”
Section: Genetic Algorithmmentioning
confidence: 99%