2018
DOI: 10.1007/s10009-018-0493-6
|View full text |Cite
|
Sign up to set email alerts
|

A reasoning-based approach to dynamic domain reduction in test data generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 30 publications
0
1
0
Order By: Relevance
“…The method uses an incremental method to detect sub-regions, which cover the longest subpath from the beginning of a given path. The detected subdomains are further subdivided, and this process is repeated until the generated test data completely covers the path [24]. Dang et al investigated the correlation between the true branches of the variant sentence and proposed a method for executable path generation for weak mutation testing.…”
Section: A Generating Test Data For One Target Pathmentioning
confidence: 99%
“…The method uses an incremental method to detect sub-regions, which cover the longest subpath from the beginning of a given path. The detected subdomains are further subdivided, and this process is repeated until the generated test data completely covers the path [24]. Dang et al investigated the correlation between the true branches of the variant sentence and proposed a method for executable path generation for weak mutation testing.…”
Section: A Generating Test Data For One Target Pathmentioning
confidence: 99%