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

Code-coverage guided prioritized test generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2008
2008
2016
2016

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 32 publications
(6 citation statements)
references
References 18 publications
0
6
0
Order By: Relevance
“…In 2002, some researchers have proposed function level prioritization in addition to statement level prioritization [9]. Li et al suggested a framework that produces the test cases covering the points given higher preference by computing preferences using code coverage capability [10]. Aggrawal et al suggested an approach based on code coverage criteria but this technique especially focuses upon version specific test case prioritization [11].…”
Section: Related Workmentioning
confidence: 99%
“…In 2002, some researchers have proposed function level prioritization in addition to statement level prioritization [9]. Li et al suggested a framework that produces the test cases covering the points given higher preference by computing preferences using code coverage capability [10]. Aggrawal et al suggested an approach based on code coverage criteria but this technique especially focuses upon version specific test case prioritization [11].…”
Section: Related Workmentioning
confidence: 99%
“…Li et al [48] presented a methodology for code coveragebased path selection and test data generation, based on Li's previous work [47]. They [48] proposed a path selection technique that considers the program priority and call relationships among class methods to identify a set of paths through the code, which has high-priority code unit.…”
Section: Related Workmentioning
confidence: 99%
“…They [48] proposed a path selection technique that considers the program priority and call relationships among class methods to identify a set of paths through the code, which has high-priority code unit. Then, constraint analysis method is used to find object attributes and method parameter values for generating tests to traverse through the selected sequence of paths.…”
Section: Related Workmentioning
confidence: 99%
“…Li et al [33] presented a methodology for code coverage-based path selection and test data generation, based on Li's previous work [32] . They [33] proposed a path selection technique that considers the program priority and call relationships among class methods to identify a set of paths through the code, which has high priority code unit.…”
Section: Code Prioritizationmentioning
confidence: 99%
“…They [33] proposed a path selection technique that considers the program priority and call relationships among class methods to identify a set of paths through the code, which has high priority code unit. Then, constraint analysis method is used to find object attributes and method parameter values for generating tests to traverse through the selected sequence of paths.…”
Section: Code Prioritizationmentioning
confidence: 99%