Abstract:
It is a novel technique for automatic test pattern generation which well detects both easy to detect faults and hard to detect faults. ATPG based on this SAT technique dynamic clause activation (DCA) generates a limited number of test patterns which can cover more faults. ATPG based on implication graph have problems to cope with hard-to- detect faults. ATPG based on Boolean satisfiability does not work on a structural form. In SAT solver method the problem is transferred in to a Boolean formula and a SAT solver is used to solve this problem. It has disadvantages such as overhead for CNF transformation and over specified solutions. In the proposed method, the solving problem is directed by structural information which is provided dedicated data structures. The technique is designed such that the efficient solving techniques and data structures of SAT solver do not have to be modified. This is a crucial to retain the high efficiency of a SAT based algorithm. The proposed method is fast and provides a very high fault efficiency and useful in large industrial circuit.

Keywords: ATPG, Boolean Satisfiability, Dynamic SAT, Fault Coverage, SA technique