Abstract---The growing size and complexity of VLSI circuits have made quality and reliability requirements increasingly stringent. The work presented in this paper investigates the application of Boolean Satisfiability (SAT)-based techniques to address two distinct VLSI testing activities, namely, test vector generation to excite stuck-open faults in CMOS circuits, and test vector generation for dynamic burn-in testing. The presence of a stuck-open fault renders an otherwise combinational logic gate sequential, therefore causing a malfunction of the integrated circuit. On the other hand, burn-in screening has been an integral part of semiconductors manufacturing to assure that reliability goals are achieved. The purpose of this type of testing is to apply to the device under test a set of input patterns which maximizes the circuits nodal activity, and by so doing causing an increase in its power dissipation that leads to device failures like electromigration and hot-carrier degradation at an early stage of the device operation. The search for input or test patterns to either excite a stuckopen fault, or to maximize the activity in the circuit is an NPcomplete problem. In this work, we discuss the applicability of SAT methodologies in tackling these two testing problems. We experiment with SAT and Integer Linear Programming (ILP) solvers to compute solution sets for these two testing activities.
Index Terms---Stuck-Open, Burn-in Testing, Integer Linear Programming, Boolean Satisfiability.
Cite: Fadi A. Aloul and Assim Sagahyroon, "Using SAT-Based Techniques in Test Vectors Generation," Journal of Advances in Information Technology, Vol. 1, No. 4, pp. 153-162, November, 2010.doi:10.4304/jait.1.4.153-162
Copyright © 2013-2020. JAIT. All Rights Reserved
This work is licensed under the Creative Commons Attribution License (CC BY-NC-ND 4.0)