%0 Conference Paper %1 corno:2002:emctpi %A Corno, F. %A Cumani, G. %A Sonza Reorda, M. %A Squillero, G. %B Proceedings of the 2002 Congress on Evolutionary Computation CEC2002 %C Honolulu, Hawaii, USA %D 2002 %E Fogel, David B. %E El-Sharkawi, Mohamed A. %E Yao, Xin %E Greenwood, Garry %E Iba, Hitoshi %E Marrow, Paul %E Shackleton, Mark %I IEEE Press %K ATPG, Algorithms, Approaches Approximate DAG, Evolutionary Methods, Micro-Processors, Simulation-Based algorithms, genetic programming, %P 1486--1491 %T Efficient Machine-Code Test-Program Induction %U http://citeseer.ist.psu.edu/502344.html %X Technology advances allow integrating on a single chip entire system, including memories and peripherals. The test of these devices is becoming a major issue for manufacturing industries. This paper presents a methodology for inducing test-programs similar to genetic programming. However, it includes the ability to explicitly specify registers and resorts to directed acyclic graphs instead of trees. Moreover, it exploits a database containing the assembly-level semantic associated to each graph node. This approach is extremely efficient and versatile: candidate solutions are translated into source-code programs allowing millions of evaluations per second. The proposed approach is extremely versatile: the macro library allows easily changing target processor and environment. The approach was verified on three processors with different instruction sets, different formalisms and different conventions. A complete set of experiments on a test function are also reported for the SPARC processor. %@ 0-7803-7278-6

@inproceedings{corno:2002:emctpi, abstract = {Technology advances allow integrating on a single chip entire system, including memories and peripherals. The test of these devices is becoming a major issue for manufacturing industries. This paper presents a methodology for inducing test-programs similar to genetic programming. However, it includes the ability to explicitly specify registers and resorts to directed acyclic graphs instead of trees. Moreover, it exploits a database containing the assembly-level semantic associated to each graph node. This approach is extremely efficient and versatile: candidate solutions are translated into source-code programs allowing millions of evaluations per second. The proposed approach is extremely versatile: the macro library allows easily changing target processor and environment. The approach was verified on three processors with different instruction sets, different formalisms and different conventions. A complete set of experiments on a test function are also reported for the SPARC processor.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Honolulu, Hawaii, USA}, author = {Corno, F. and Cumani, G. and {Sonza Reorda}, M. and Squillero, G.}, biburl = {https://www.bibsonomy.org/bibtex/22e0cb2129ffef53d3f6701187e1320b1/brazovayeye}, booktitle = {Proceedings of the 2002 Congress on Evolutionary Computation CEC2002}, editor = {Fogel, David B. and El-Sharkawi, Mohamed A. and Yao, Xin and Greenwood, Garry and Iba, Hitoshi and Marrow, Paul and Shackleton, Mark}, interhash = {b8f25c70d2d424c67635eb428f17318e}, intrahash = {2e0cb2129ffef53d3f6701187e1320b1}, isbn = {0-7803-7278-6}, keywords = {ATPG, Algorithms, Approaches Approximate DAG, Evolutionary Methods, Micro-Processors, Simulation-Based algorithms, genetic programming,}, notes = {CEC 2002 - A joint meeting of the IEEE, the Evolutionary Programming Society, and the IEE. Held in connection with the World Congress on Computational Intelligence (WCCI 2002) Also known as \cite{Corno:2002:EMTI} \cite{squillero:2005:GPEM} says corno:2002:emctpi uses straightforward mu+lambda evolution.}, organisation = {IEEE Neural Network Council (NNC), Institution of Electrical Engineers (IEE), Evolutionary Programming Society (EPS)}, pages = {1486--1491}, publisher = {IEEE Press}, publisher_address = {445 Hoes Lane, P.O. Box 1331, Piscataway, NJ 08855-1331, USA}, size = {6 pages}, timestamp = {2008-06-19T17:38:08.000+0200}, title = {Efficient Machine-Code Test-Program Induction}, url = {http://citeseer.ist.psu.edu/502344.html}, year = 2002 }