A new tool for random testability evaluation using simulation and formal proof

A set of tools is described, allowing one to compute random testability measurement for combinational circuits, based on a black box worst case hypothesis. These tools provide enough information to allow circuit modification, in order to meet a prescribed testability value. The efficiency of these tools is due to the use of a statistical method combined with formal proof mechanisms. The random testability of the complete ISCAS benchmark of combinational circuits is computed. For the least testable circuits, a few modifications, guided by the testability measurements, are shown to be sufficient to make them randomly testable.<<ETX>>

[1]  John Paul Shen,et al.  Inductive Fault Analysis of MOS Integrated Circuits , 1985, IEEE Design & Test of Computers.

[2]  A. J. Briers,et al.  Random Pattern Testability by Fast Fault Simulation , 1986, International Test Conference.

[3]  Sunil Jain,et al.  Statistical Fault Analysis , 1985, IEEE Design & Test of Computers.

[4]  Sudhakar M. Reddy,et al.  Fault Detection and Design For Testability of CMOS Logic Circuits , 1988 .

[5]  Edward McCluskey,et al.  Designing CMOS Circuits for Switch-Level Testability , 1987, IEEE Design & Test of Computers.

[6]  Masahiro Fujita,et al.  Evaluation and improvement of Boolean comparison method based on binary decision diagrams , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[7]  M. E. Levitt,et al.  Physical design of testable VLSI: techniques and experiments , 1990 .

[8]  Mireille Jacomino,et al.  A new approach of test confidence estimation , 1989, [1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[9]  René David,et al.  About Random Fault Detection of Combinational Networks , 1976, IEEE Transactions on Computers.

[10]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[11]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[12]  R. David,et al.  Binary-decision graphs for implementation of Boolean functions , 1985 .

[13]  Sudhakar M. Reddy,et al.  Design of robustly testable combinational logic circuits , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Vishwani D. Agrawal,et al.  A Statistical Theory of Digital Circuit Testability , 1990, IEEE Trans. Computers.