By Topic

A SAT Method for Improving Test Pattern Generation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Liu Xin ; School of Electrical & Electronic Engineering, Hubei University of Technology, Wuhan 430068 China ; Xiong Youlun

This paper presents a solution for test pattern generation (TPG) based on Boolean satisfiability (SAT). The key to a SAT-solver can be scalable is that it is able to take into account the information about high-level structure of formulas. The paper augments a circuit structure layer to the SAT-solver to maintain circuit-related information and value justification relations. It dovetails binary decision graphs (BDD) and SAT techniques to improve the efficiency of test pattern generation. More specifically, it first exploits inexpensive reconvergent fanout analysis of circuit to gather information on the local signal correlation by using BDD learning. It then uses the above learned information to restrict and focus the overall search space of SAT-based TPG. Its learning technique is effective and lightweight. The experimental results demonstrate the effectiveness of the approach.

Published in:

Electronic Measurement and Instruments, 2007. ICEMI '07. 8th International Conference on

Date of Conference:

Aug. 16 2007-July 18 2007