Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleMarch 2003
True Coverage: A Goal of Verification
There are a number of RTL coverage tools on themarket today that essentially tells you only that a set ofsignals has been toggled by a particular diagnostic test.This is useful in showing what areas of the RTL designare definitely not covered by the ...
- ArticleApril 1996
Consistently dominant fault model for tristate buffer nets
Unknown values result from floating and contention type faults on tristate buffer nets thereby causing MISR signature loss during test pattern compression. A Consistently Dominant Fault model is presented that removes the problem and permits fault ...
- ArticleNovember 1995
Functional test generation for path delay faults
We present a novel test generation technique for path delay faults, based on the growth (G) and disappearance (D) faults of programmable logic arrays (PLA). The circuit is modeled as a PLA that is prime and irredundant with respect to every output. ...
- research-articleMay 1987
General Criterion for Essential Nonfault Locatability of Logical Functions
IEEE Transactions on Computers (ITCO), Volume 36, Issue 5Pages 623–629https://doi.org/10.1109/TC.1987.1676948This correspondence presents a solution of a well-known essential problem of diagnostics open till now. The method of solution is based on a straight application of mathematical structures theory 1121, [11]and on a topological representation of Boolean ...
- surveyDecember 1983
On the Acceleration of Test Generation Algorithms
IEEE Transactions on Computers (ITCO), Volume 32, Issue 12Pages 1137–1144https://doi.org/10.1109/TC.1983.1676174In order to accelerate an algorithm for test generation, it is necessary to reduce the number of backtracks in the algorithm and to shorten the process time between backtracks. In this paper, we consider several techniques to accelerate test generation ...
- research-articleAugust 1981
On Closedness and Test Complexity of Logic Circuits
IEEE Transactions on Computers (ITCO), Volume 30, Issue 8Pages 556–562https://doi.org/10.1109/TC.1981.1675840The concept of closedness of a set of logic functions under stuck-type faults is introduced. All sets of logic functions closed under stuck-type faults are classified. For the sets of logic functions closed under stuck-type faults, the test complexity ...
- research-articleMarch 1981
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
IEEE Transactions on Computers (ITCO), Volume 30, Issue 3Pages 215–222https://doi.org/10.1109/TC.1981.1675757The D-algorithm (DALG) is shown to be ineffective for the class of combinational logic circuits that is used to implement error correction and translation (ECAT) functions. PODEM (path-oriented decision making) is a new test generation algorithm for ...