On test program compaction

While compaction of binary test sequences for generic sequential circuits has been widely explored, the compaction of test programs for processor-based systems is still an open area of research. Test program compaction is practically important because there are several scenarios in which Software-based Self-Test (SBST) is adopted, and the size of the test program is often a critical parameter. This paper is among the first to propose algorithms able to automatically compact an existing test program. The proposed solution is based on instruction removal and restoration, which is shown to significantly reduce the computational cost compared with instruction removal alone. Experimental results are reported, showing the compaction capabilities and computational costs of the proposed algorithms.

[1]  Irith Pomeranz,et al.  Vector restoration based static compaction of test sequences for synchronous sequential circuits , 1997, Proceedings International Conference on Computer Design VLSI in Computers and Processors.

[2]  Jacob A. Abraham,et al.  Test Generation for Microprocessors , 1980, IEEE Transactions on Computers.

[3]  Irith Pomeranz,et al.  Vector replacement to improve static-test compaction forsynchronous sequential circuits , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Matteo Sonza Reorda,et al.  Microprocessor Software-Based Self-Testing , 2010, IEEE Design & Test of Computers.

[5]  Paolo Bernardi,et al.  On the in-field functional testing of decode units in pipelined RISC processors , 2014, 2014 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT).

[6]  S.T. Chakradhar,et al.  Static compaction using overlapped restoration and segment pruning , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[7]  Giovanni Squillero,et al.  An Effective Technique for the Automatic Generation of Diagnosis-Oriented Programs for Processor Cores , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Zeljko Zilic,et al.  Test compaction techniques for assertion-based test generation , 2013, TODE.

[9]  Irith Pomeranz,et al.  On static compaction of test sequences for synchronous sequential circuits , 1996, DAC '96.

[10]  Bernd Becker,et al.  An effective approach to automatic functional processor test generation for small-delay faults , 2014, 2014 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[11]  Giovanni Squillero,et al.  Enhanced Test Program Compaction Using Genetic Programming , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[12]  Michael S. Hsiao,et al.  Fast algorithms for static compaction of sequential circuit test vectors , 1997, Proceedings. 15th IEEE VLSI Test Symposium (Cat. No.97TB100125).

[13]  Michael S. Hsiao,et al.  State relaxation based subsequence removal for fast static compaction in sequential circuits , 1998, Proceedings Design, Automation and Test in Europe.

[14]  Irith Pomeranz,et al.  Vector-restoration-based static compaction using random initial omission , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[15]  Irith Pomeranz,et al.  SIFAR: static test compaction for synchronous sequential circuits based on single fault restoration , 2000, Proceedings 18th IEEE VLSI Test Symposium.

[16]  Irith Pomeranz,et al.  Enumeration of Test Sequences in Increasing Chronological Order to Improve the Levels of Compaction Achieved by Vector Omission , 2002, IEEE Trans. Computers.

[17]  Giovanni Squillero,et al.  Evolutionary Optimization: the µGP toolkit , 2011 .

[18]  Matteo Sonza Reorda,et al.  High Quality System Level Test and Diagnosis , 2014, 2014 IEEE 23rd Asian Test Symposium.

[19]  Paolo Bernardi,et al.  On the Functional Test of the Register Forwarding and Pipeline Interlocking Unit in Pipelined Processors , 2013, 2013 14th International Workshop on Microprocessor Test and Verification.