2011 IEEE 14th International Multitopic Conference 2011
DOI: 10.1109/inmic.2011.6151487
|View full text |Cite
|
Sign up to set email alerts
|

Improving path selection by handling loops in automatic test data generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…The execution of more than one iteration of a loop in parallel programs comprises the execution of different paths and new associations among processes interacting, so it is essential to analyze data, communication, and control flows in further iterations. Different studies address such issues with methods to determine the number of iterations of a loop 8,9,17,18 …”
Section: Challenges For Coverage Of Communication Events Into Loopsmentioning
confidence: 99%
“…The execution of more than one iteration of a loop in parallel programs comprises the execution of different paths and new associations among processes interacting, so it is essential to analyze data, communication, and control flows in further iterations. Different studies address such issues with methods to determine the number of iterations of a loop 8,9,17,18 …”
Section: Challenges For Coverage Of Communication Events Into Loopsmentioning
confidence: 99%
“…The approach of Zanjani et al (ZANJANI;FULADI;AGHABABA, 2011) selects paths from loops focusing on the feasibility of selected paths, using dynamic analysis to traverse the CFG and symbolic execution to determine the type of the loop and thus obtain the number of iterations. Zanjani et al defines rules that loops must accomplish to implement the method, and presents characteristics of the CFG representation.…”
Section: Capturing Information From Loopsmentioning
confidence: 99%