By Topic

On the Computational Complexity of Parameter Estimation in Adaptive Testing Strategies

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

5 Author(s)
Feng Ye ; Dept. of Autom. Control, Beijing Univ. of Aeronaut. & Astronaut., Beijing, China ; Chang Liu ; Hu, H. ; Chang-Hai Jiang
more authors

Adaptive testing is the counterpart of adaptive control in software testing. It means that software testing strategy should be adjusted on-line by using the testing data collected during software testing as our understanding of the software under test improves. In doing so, online estimation of parameters plays a crucial role. In this paper, we investigate the computational complexity of the parameter estimation process in two adaptive testing strategies which adopt different parameter estimation methods, namely the genetic algorithm (GA) method and the recursive least square estimation (RLSE) method. Theoretical analysis and simulations are conducted to compare the asymptotic complexity and the runtime overhead of the two adaptive testing strategies. Finally, a controlled experiment on the space program is conducted to measure the relationship between computational complexity and the failure detection efficiency for the two strategies.

Published in:

Dependable Computing, 2009. PRDC '09. 15th IEEE Pacific Rim International Symposium on

Date of Conference:

16-18 Nov. 2009