Test and Verification
Test and Debug in Deep-Submicron Technologies
Ramyanshu Datta, Antony Sebastine, Ravi Gupta, Whitney J. Townsend, and Jacob A. Abraham
5th IBM Austin Center for Advanced Studies Conference
Austin, TX, February 19-20, 2004
Abstract
With the scaling of feature sizes into Deep-Submicron (DSM) values, the level of integration and performance achievable in VLSI chips increases. A lot of work has been directed to tackle design related issues arising out of scaling, like leakage mitigation etc. However efforts to enhance testability of such designs have not been sufficient. It is not viable to overlook testability issues arising out of these designs because the defect sizes do not scale proportional to the feature sizes. Previously effective fault models like stuck-at appear archaic and are unable to model faults accurately. This necessitates the need for more detailed models which can more explicitly model the behavior of faulty DSM chips. Also there is a significant increase in delay faults in logical paths of integrated circuits. Delay faults cause the delay of paths in a chip to be larger than expected resulting in the output of a chip to be deviant from the expected behavior, in spite of the chip being functionally correct. Efficient techniques are needed for detecting such defects in first silicon and eliminating them before the final versions of the chips are shipped. This requires efficient debug techniques for performance characterization of large complex integrated circuits in deep-submicron and nanometer technologies. In this paper we present an insight into test challenges arising out of deep submicron technologies and effective approaches to tackle the same.
pdf
Program Slicing for ATPG-Based Property Checking *
Vivekananda M. Vedula, Whitney J. Townsend, and Jacob A. Abraham
17th International Conference on VLSI Design
pp. 591-596, Mumbai, India, January 5-9, 2004
Abstract
This paper presents a novel technique for abstracting designs in order to increase the efficiency of formal property checking. Bounded Model Checking (BMC), using Satisfiability (SAT) techniques, are beginning to be widely used for checking properties of designs. Recent approaches using sequential ATPG techniques, which harness the structural information of the design, have been shown to perform better than SAT-based BMC. However, these techniques require an effective methodology to deal with the size of commercial designs. A program slicing methodology that has been shown to accelerate sequential ATPG is adapted and integrated into an ATPG-based BMC framework. Furthermore, a generalization of the ATPG-based approach, which checks for unbounded liveness, is also presented.
pdf
* This material is based upon work supported under a National Science Foundation Graduate Research Fellowship.