Microprocessor Design Verification by Two-Phase Evolution of Variable Length Tests

Created by W.Langdon from gp-bibliography.bib Revision:1.8129

@InProceedings{smith:1997:rGP2pevltmdv,

• author = "J. E. Smith and M. Bartley and T. C. Fogarty",
• title = "Microprocessor Design Verification by Two-Phase Evolution of Variable Length Tests",
• booktitle = "Proceedings of the 1997 {IEEE} International Conference on Evolutionary Computation",
• year = "1997",
• pages = "453--458",
• address = "Indianapolis",
• publisher_address = "Piscataway, NJ, USA",
• month = "13-16 " # apr,
• publisher = "IEEE Press",
• keywords = "genetic algorithms, genetic programming, SBSE",
• URL = "http://citeseer.ist.psu.edu/cache/papers/cs/1134/http:zSzzSzwww.ics.uwe.ac.ukzSzpaperszSzJS1997a.pdf/smith97microprocessor.pdf",
• URL = "http://citeseer.ist.psu.edu/171256.html",
• DOI = "doi:10.1109/ICEC.1997.592354",
• abstract = "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",
• notes = "ICEC-97",

}

Genetic Programming entries for James Smith M Bartley Terence C Fogarty

Citations