A hierarchically defined fault pattern generator using genetic algorithm Online publication date: Sun, 28-Mar-2010
by Dhiraj Sangwan, Rajesh Kumar, Mukesh Kumar
International Journal of Adaptive and Innovative Systems (IJAIS), Vol. 1, No. 2, 2010
Abstract: Test generation using fault algorithms is a complex procedure. This paper presents a hierarchical approach for test vector generation, which searches for a compact set of test patterns, in an otherwise large search space. Genetic algorithms (GAs) have been effective in solving many search and optimisation problems. Since test generation is a search process over a large vector space, it is an ideal candidate for GAs. The GA evolves candidate test vectors and sequences, using a fault simulator to compute the fitness of each candidate test. Various GA parameters are studied, including population size, fitness function and mutation rate, as well as selection and crossover schemes. The search for fitter members is possible by modifying a reference table. The main focus in this paper is on the hierarchical expansion of the module into its constituent modules and the fault analysis would be performed only on those submodules which give faulty responses. The variable crossover and mutation rates help in not being trapped in local minima. The different award numbers allows us in focussing on those test sets which give superior detection possibilities with respect to others.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Adaptive and Innovative Systems (IJAIS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com