An Iterative Heuristic for State Justi�cation in Sequential Automatic Test Pattern Generation

(2001) An Iterative Heuristic for State Justi�cation in Sequential Automatic Test Pattern Generation. Genetic and Evolutionary Computation Conference (GECCO).

[img]
Preview
PDF
An_Iterative_Heuristic_for_State_Justification_in_Sequential_Automatic_Test_Pattern_Generation_GECCO2001.pdf

Download (165kB) | Preview

Abstract

State justifcation is one of the most time-consuming tasks in sequential Automatic Test Pattern Generation (ATPG). For states that are difficult to justify, deterministic algorithms take significant CPU time without much success most of the time. In this work, we adopt a hybrid approach for state justification. A new method based on Genetic Algorithms is proposed, in which we engineer state justifcation sequences vector by vector. The proposed method is compared with previous GA-based approaches. Significant improvements have been obtained for ISCAS benchmark circuits in terms of state coverage and CPU time.

Item Type: Article
Subjects: Computer
Department: College of Computing and Mathematics > Computer Engineering
Depositing User: AIMAN HELMI EL-MALEH
Date Deposited: 28 Feb 2008 16:41
Last Modified: 01 Nov 2019 13:22
URI: https://eprints.kfupm.edu.sa/id/eprint/151