loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
28th Annual International Computer Software and Applications Conference - Workshops and Fast Abstracts - (COMPSAC'04)
Adaptive Random Testing with CG Constraint
Hong Kong
September 28-September 30
ISBN: 0-7695-2209-2
F. T. Chan, University of Hong Kong
K. P. Chan, University of Hong Kong
T. Y. Chen, Swinburne University of Technology
S. M. Yiu, University of Hong Kong
In this paper, we introduce a C. G. constraint on Adaptive Random Testing (ART) for programs with numerical input. One rationale behind Adaptive Random Testing is to have the test candidates to be as widespread over the input domain as possible. However, the computation may be quite expensive in some cases. The C. G. constraint is introduced to maintain the wide-spreadness while reducing the computation requirement in terms of number of distance measures. Three variations of C. G. constraints and their performance when compared with ART are discussed.
Index Terms:
Random Testing, Adaptive Random Testing, Center of Gravity constraint
Citation:
F. T. Chan, K. P. Chan, T. Y. Chen, S. M. Yiu, "Adaptive Random Testing with CG Constraint," compsac, vol. 2, pp.96-99, 28th Annual International Computer Software and Applications Conference - Workshops and Fast Abstracts - (COMPSAC'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.