Bounding Signal Probabilities for Testability Measurement Using Conditional Syndromes
暂无分享,去创建一个
[1] M. Ray Mercer,et al. Testability Measures : What Do They Tell Us ? , 1982, ITC.
[2] Edward J. McCluskey,et al. Probabilistic Treatment of General Combinational Networks , 1975, IEEE Transactions on Computers.
[3] Jacob Savir,et al. Good Controllability and Observability Do Not Guarantee Good Testability , 1983, IEEE Transactions on Computers.
[4] Vishwani D. Agrawal,et al. STAFAN: An Alternative to Fault Simulation , 1984, 21st Design Automation Conference Proceedings.
[5] F. Brglez,et al. A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .
[6] Ioannis G. Tollis,et al. Improved Techniques for Estimating Signal Probabilities , 1989, IEEE Trans. Computers.
[7] George Markowsky. Bounding Signal Probabilities in Combinational Circuits , 1987, IEEE Transactions on Computers.
[8] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[9] Jacob Savir,et al. Random Pattern Testability of Delay Faults , 1988, IEEE Trans. Computers.
[10] René David,et al. About Random Fault Detection of Combinational Networks , 1976, IEEE Transactions on Computers.
[11] Rhonda Kay Gaede,et al. Calculation of Greatest Lower Bounds Obtainable by the Cutting Algorithm , 1986, ITC.
[12] Edward J. McCluskey,et al. Analysis of Logic Circuits with Faults Using Input Signal Probabilities , 1975, IEEE Transactions on Computers.
[13] VISHWANI D. AGRAWAL. When to Use Random Testing , 1978, IEEE Transactions on Computers.
[14] M. Ray Mercer,et al. Correlating Testability with Fault Detection , 1984, ITC.
[15] Jacob Savir,et al. Syndrome-Testable Design of Combinational Circuits , 1980, IEEE Transactions on Computers.
[16] Jacob Savir,et al. On Random Pattern Test Length , 1984, IEEE Transactions on Computers.
[17] Parker,et al. Design for Testability—A Survey , 1982, IEEE Transactions on Computers.