Speed up of test generation using high-level primitives

  • Authors:
  • Ramachandra P. Kunda;Jacob A. Abraham;Bharat Deep Rathi;Prakash Narain

  • Affiliations:
  • University of Illinois, Urbana, Il;University of Texas Austin, TX;IBM T. J. Watson Research Center, Yorktown Heights, NY;University of Illinois, Urbana, Il

  • Venue:
  • DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
  • Year:
  • 1991

Quantified Score

Hi-index 0.01

Visualization

Abstract

We propose a general methodology to speed up the test generation process for circuits with high-level primitives. Our search procedure is a variation of depth first search that tries to fully exploit the capabilities of a computer to execute complex arithmetic and logical operations. We present techniques for signal value justification, and fault propagation, which are used by our algorithm. We have implemented a dependency-directed backtracking method to speed up our algorithm. This methodology has been applied to six circuits and the results are found to be very encouraging.