Coupling EA and high-level metrics for the automatic generation of test blocks for peripheral cores
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A novel methodology for diversity preservation in evolutionary algorithms
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Automatic detection of software defects: an industrial experience
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Design validation of multithreaded architectures using concurrent threads evolution
Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes
Exploiting MOEA to automatically geneate test programs for path-delay faults in microprocessors
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
An overview of AI research in Italy
Artificial intelligence
Human-competitive results produced by genetic programming
Genetic Programming and Evolvable Machines
Journal of Electronic Testing: Theory and Applications
An efficient distance metric for linear genetic programming
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
Core War is a game where two or more programs, called warriors, are executed in the same memory area by a time-sharing processor. The final goal of each warrior is to crash the others by overwriting them with illegal instructions. The game was popularized by A. K. Dewdney in his Scientific American column in the mid-1980s. In order to automatically devise strong warriors, μGP, a test program generation algorithm, was extended with the ability to assimilate existing code and to detect clones; furthermore, a new selection mechanism for promoting diversity independent from fitness calculations was added. The evolved warriors are the first machine-written programs ever able to become King of the Hill (champion) in all four main international Tiny Hills. This paper shows how playing Core War may help generate effective test programs for validation and test of microprocessors. Tackling a more mundane problem, the described techniques are currently being exploited for the automatic completion and refinement of existing test programs. Preliminary experimental results are reported.