36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of The 2003
DOI: 10.1109/hicss.2003.1174917
|View full text |Cite
|
Sign up to set email alerts
|

Breeding software test cases with genetic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
29
0

Year Published

2005
2005
2020
2020

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 73 publications
(32 citation statements)
references
References 10 publications
0
29
0
Order By: Relevance
“…Berndt et al [10] described a framework that differentiates between absolute and relative fitness function to organize projects reliance. GA includes a fossil record that store the past data, allowing any current fitness calculations to be influenced by past generations.…”
Section: Related Workmentioning
confidence: 99%
“…Berndt et al [10] described a framework that differentiates between absolute and relative fitness function to organize projects reliance. GA includes a fossil record that store the past data, allowing any current fitness calculations to be influenced by past generations.…”
Section: Related Workmentioning
confidence: 99%
“…The investigation of Wegener et al indicate that the number of test data that use the generation based on genetic algorithm is least than that use random test generation for the branch cover criterion of triangle program [4]. A fossil record of organisms and genetic algorithm had been introduced into test data generation by Berndt et al [5,6]. Khor [8].…”
Section: Introductionmentioning
confidence: 98%
“…Automatic generation of test cases is a process that looked for a group of testing data to meet the given criteria in Peng Wang ⋅ Xiao-juan ⋅ Hu ⋅ Ning-jia Qiu ⋅ Hua-min Yang Department of Computer Science Changchun University of Science and Technology Changchun, Jili Province, China e-mail: wangpeng@cust.edu.cn a data field. In recent years, the problem of which is generating the test case has transformed into the path search problems [4][5]. As the test case generation is an undecidable problem, accounting for the measured size and complexity of procedures, the general search algorithm has been extremely limited.…”
Section: Introductionmentioning
confidence: 99%