While compaction of binary test sequences for generic sequential circuits has been widely explore, 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.

On Test Program Compaction / Gaudesi, Marco; SONZA REORDA, Matteo; Irith, Pomeranz. - STAMPA. - 1:(2015), pp. 1-6. (Intervento presentato al convegno Test Symposium (ETS), 2015 20th IEEE European tenutosi a Cluj-Napoca nel 25-29 May 2015) [10.1109/ETS.2015.7138771].

On Test Program Compaction

GAUDESI, MARCO;SONZA REORDA, Matteo;
2015

Abstract

While compaction of binary test sequences for generic sequential circuits has been widely explore, 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.
2015
978-1-4799-7603-4
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2591394
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo