1999
DOI: 10.1016/s0164-1212(99)00071-0
|View full text |Cite
|
Sign up to set email alerts
|

An automatic approach of domain test data generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2000
2000
2019
2019

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 17 publications
0
6
0
Order By: Relevance
“…Jeng et al partitioned a system's input domain D into a finite set of subdomains D 1 , · · · , D n according to the specification, such that the system's behaviours were uniform on each D i , and then produced test inputs that were close to the boundaries of the subdomains with the aim of finding shifts in boundaries [27,13]. Clarke et al considered the use of boundary testing for path testing [5].…”
Section: Related Workmentioning
confidence: 99%
“…Jeng et al partitioned a system's input domain D into a finite set of subdomains D 1 , · · · , D n according to the specification, such that the system's behaviours were uniform on each D i , and then produced test inputs that were close to the boundaries of the subdomains with the aim of finding shifts in boundaries [27,13]. Clarke et al considered the use of boundary testing for path testing [5].…”
Section: Related Workmentioning
confidence: 99%
“…There are several approaches to BVA (see, e.g., Jeng and Forgacs [1999], Jeng and Weyuker [1994], Richardson and Clarke [1985], White and Cohen [1980]). These are based on geometric arguments in which we choose a set T of test inputs for a boundary B such that if there is a boundary shift in B within the implementation, then it is likely that at least one value from T will be in the wrong subdomain in the implementation.…”
Section: Overviewmentioning
confidence: 99%
“…If the conditions can be represented using a set of linear constraints, then we can apply linear programming techniques. However, there are many more general search and constraint solving techniques that have been used in automated test data generation and these might be used when the constraints are not linear (for more on automated test data generation, see, e.g., DeMillo and Offutt [1991], Dick and Faivre [1993], Fernandez et al [1996], Jeng and Forgacs [1999], Jones et al [1998], McMinn [2004, Michael et al [2001], Pargas et al [1999]). …”
Section: R M Hieronsmentioning
confidence: 99%
See 2 more Smart Citations