By Topic

Microprocessor design verification by two-phase evolution of variable length tests

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

3 Author(s)
Smith, J.E. ; Fac. of Comput. Studies & Math., Univ. of the West of England, Bristol, UK ; Bartley, M. ; Fogarty, T.C.

This paper discusses the use of a genetic algorithm to generate test programs for the verification of the design of a modern microprocessor. The algorithm directly learns sequences of assembly-code instructions which satisfy a coverage metric for one specific part of a design. The complexity of the design is such that it is not simple to predict in advance the length of the program needed to achieve coverage, and there is a severe time penalty for evaluating long tests. This has led to the development of a genetic algorithm which uses a two phase mechanism for variation in string length, through maintenance of a diverse population with varying lengths coupled with a “meta-algorithm” for periodic larger increases

Published in:

Evolutionary Computation, 1997., IEEE International Conference on

Date of Conference:

13-16 Apr 1997