Why is ATPG easy?

Empirical observation shows that practically encountered instances of ATPG are efficiently solvable. However, it has been known for more than two decades that ATPG is an NP-complete problem. This work is one of the first attempts to reconcile these seemingly disparate results. We introduce the concept of circuit cut-width and characterize the complexity of ATPG in terms of this property. We provide theoretical and empirical results to argue that an interestingly large class of practical circuits have cut-width characteristics which ensure a provably efficient solution of ATPG on them.

[1]  Michael E. Saks,et al.  A Complexity Index for Satisfiability Problems , 1994, IPCO.

[2]  Jun Gu,et al.  Algorithms for the satisfiability (SAT) problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

[3]  Hideo Fujiwara.  Computational Complexity of Controllability/Observability Problems for Combinational Circuits , 1990, IEEE Trans. Computers.

[4]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[5]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[6]  Kenneth L. McMillan,et al.  Symbolic model checking: an approach to the state explosion problem , 1992 .

[7]  Olivier Coudert.  Exact coloring of real-life graphs is easy , 1997, DAC.

[8]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[9]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: application in VLSI domain , 1997, DAC.

[10]  Daniel Brand.  Verification of large synthesized designs , 1993, ICCAD.

[11]  Jonathan Rose,et al.  Characterization and parameterized random generation of digital circuits , 1996, DAC '96.

[12]  Robert K. Brayton,et al.  Combinational test generation using satisfiability , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Kwang-Ting Cheng,et al.  Multi-level logic optimization by redundancy addition and removal , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.

[14]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[15]  J. P. Grossman,et al.  Characterization and parameterized random generation of digital circuits , 1996, 33rd Design Automation Conference Proceedings, 1996.

[16]  S. Yang,et al.  Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 , 1991 .

[17]  Tracy Larrabee.  Efficient generation of test patterns using Boolean difference , 1989, Proceedings. 'Meeting the Tests of Time'., International Test Conference.

[18]  P. R. Stephan,et al.  SIS : A System for Sequential Circuit Synthesis , 1992 .

[19]  Hideo Fujiwara.  Computational complexity of controllability/observability problems for combinational circuits , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[20]  Robert K. Brayton,et al.  MIS: A Multiple-Level Logic Optimization System , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[21]  Thomas W. Williams,et al.  Testing Logic Networks and Designing for Testability , 1979, Computer.

[22]  Arvind Srinivasan,et al.  Verity - A formal verification program for custom CMOS circuits , 1995, IBM J. Res. Dev..

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  Alberto Sangiovanni-Vincentelli,et al.  Logic Verification, Testing and their Relationship to Logic Synthesis , 1988 .

[25]  Paul Walton Purdom,et al.  Polynomial-average-time satisfiability problems , 1987, Inf. Sci..

[26]  Oscar H. Ibarra,et al.  Polynomially Complete Fault Detection Problems , 1975, IEEE Transactions on Computers.

[27]  C. Leonard Berman,et al.  Circuit width, register allocation, and ordered binary decision diagrams , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..