Abstract | ||
---|---|---|
Test programs are fragment of code, but, unlike ordinary application programs, they are not intended to solve a problem, nor to calculate a function. Instead, they are supposed to give information about the machine that actually executes them. Today, the need for effective test programs is increasing, and, due to the inexorable increase in the number of transistor that can be integrated onto a single silicon die, devising effective test programs is getting more problematical. This paper presents µGP, an efficient and versatile approach to test-program generation based on an evolutionary algorithm. The proposed methodology is highly versatile and improves previous approaches, allowing the test-program generator generating complex assembly programs that include subroutines calls. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1007/3-540-36599-0_28 | EuroGP |
Keywords | Field | DocType |
proposed methodology,test program,effective test program,complex assembly program,enhanced framework,inexorable increase,test-program generator,evolutionary algorithm,ordinary application program,versatile approach,microprocessor test-program generation,previous approach | Evolutionary algorithm,Subroutine,Simulation,Computer science,Microprocessor,Directed acyclic graph,Assembly language,Die (integrated circuit),Computer engineering,Genetic algorithm,Genetic program,Distributed computing | Conference |
Volume | ISSN | ISBN |
2610 | 0302-9743 | 3-540-00971-X |
Citations | PageRank | References |
7 | 1.25 | 9 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
F. Corno | 1 | 602 | 55.65 |
G. Squillero | 2 | 330 | 30.36 |