Parameterized Random Testing
- 1 January 1984
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0738100X,p. 510-516
- https://doi.org/10.1109/dac.1984.1585846
Abstract
Random testing uses random inputs to test digital circuits. A major problem in random testing is the cost to compute the test length which is required for achieving an acceptable fault coverage. Different input distributions on the random inputs produce different fault detection probabilities. Therefore parameterized input distributions are analyzed and analytical methods are given for computing the fault coverage as a function of the parameters. The parameters are chosen so that the fault detection probability is maximized and the test pattern length is minimized. This analytical method of analyzing random test patterns tends to be faster than fault simulation.Keywords
This publication has 5 references indexed in Scilit:
- On Random Pattern Test LengthIEEE Transactions on Computers, 1984
- Monte-Carlo algorithms for enumeration and reliability problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Random-Pattern Coverage Enhancement and Diagnosis for LSSD Logic Self-TestIBM Journal of Research and Development, 1983
- Algorithmic extremal problems in combinatorial optimizationJournal of Algorithms, 1982
- Probabilistic Analysis of Random Test Generation Method for Irredundant Combinational Logic NetworksIEEE Transactions on Computers, 1975