Cart (Loading....) | Create Account
Close category search window

Adaptive random testing with CG constraint

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chan, F.T. ; Sch. of Professional & Continuing Educ., Hong Kong Univ., China ; Chan, K.P. ; Chen, T.Y. ; Yiu, S.M.

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 widespreadness 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.

Published in:

Computer Software and Applications Conference, 2004. COMPSAC 2004. Proceedings of the 28th Annual International  (Volume:2 )

Date of Conference:

28-30 Sept. 2004

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.