This paper presents an innovative algorithm for the automatic generation of March tests. The proposed approach is able to generate an optimal March test for an unconstrained set of memory faults in very low computation time. Moreover, we propose a new complete taxonomy for memory read faults, a class of faults never carefully addressed in the past.
Memory read faults: taxonomy and automatic test generation / Benso, Alfredo; DI CARLO, Stefano; Di Natale, Giorgio; Prinetto, Paolo Ernesto. - STAMPA. - (2001), pp. 157-163. (Intervento presentato al convegno IEEE 10th AsianTest Symposium (ATS) tenutosi a Kyoto, JP nel 19-21 Nov. 2001) [10.1109/ATS.2001.990275].
Memory read faults: taxonomy and automatic test generation
BENSO, ALFREDO;DI CARLO, STEFANO;PRINETTO, Paolo Ernesto
2001
Abstract
This paper presents an innovative algorithm for the automatic generation of March tests. The proposed approach is able to generate an optimal March test for an unconstrained set of memory faults in very low computation time. Moreover, we propose a new complete taxonomy for memory read faults, a class of faults never carefully addressed in the past.| File | Dimensione | Formato | |
|---|---|---|---|
| 
									
										
										
										
										
											
												
												
												    
												
											
										
									
									
										
										
											2001-ATS-ReadFaults-AuthorVersion.pdf
										
																				
									
										
											 accesso aperto 
											Descrizione: Manuscript author version
										 
									
									
									
										
											Tipologia:
											2. Post-print / Author's Accepted Manuscript
										 
									
									
									
									
										
											Licenza:
											
											
												Pubblico - Tutti i diritti riservati
												
												
												
											
										 
									
									
										Dimensione
										9.72 MB
									 
									
										Formato
										Adobe PDF
									 
										
										
								 | 
								9.72 MB | Adobe PDF | Visualizza/Apri | 
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1499859
			
		
	
	
	
			      	Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
