PROTEST: A Tool for Probabilistic Testability Analysis

The CAD-tool PROTEST (Probabilistic Testability Analysis) is presented. PROTEST estimates for each fault of a combinational circuit its detection probability which can be used as a testability measure. Moreover it calculates the number of random test patterns which must be generated in order to achieve the required fault coverage. It is also demonstrated that the fault coverage will increase and the necessary number of random patterns will drastically decrease, if each primary input is stimulated by test patterns having specific probabilities of being logical “1”. PROTEST uses this fact and determines for each input the optimal signal probability for a randomly generated pattern.

[1]  Thomas W. Williams,et al.  A logic design structure for LSI testability , 1977, DAC '77.

[2]  Prabhakar Goel,et al.  An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits , 1981, IEEE Transactions on Computers.

[3]  Eugen I. Muehldorf,et al.  LSI logic testing — An overview , 1981, IEEE Transactions on Computers.

[4]  Gary S. Ditlow,et al.  Random Pattern Testability , 1984, IEEE Transactions on Computers.

[5]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Prathima Agrawal,et al.  Probabilistic Analysis of Random Test Generation Method for Irredundant Combinational Logic Networks , 1975, IEEE Transactions on Computers.

[7]  Vishwani D. Agrawal,et al.  STAFAN: An Alternative to Fault Simulation , 1984, 21st Design Automation Conference Proceedings.

[8]  M. Ray Mercer,et al.  Testability Measures : What Do They Tell Us ? , 1982, ITC.

[9]  Wolfgang Rosenstiel,et al.  Automatischer Entwurf hochintegrierter Schaltungen aus Beschreibungen der Schaltungsfunktion , 1984, GI Jahrestagung.

[10]  Detlev Leisengang,et al.  Fehlererkennung mit Signaturanalyse , 1983, Elektron. Rechenanlagen.