On Computing Tests for Bridging and Leakage Faults: Complexity Results and Universal Test Sets
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
State University of New YorkKeywords
This publication has 11 references indexed in Scilit:
- Increased CMOS IC stuck-at fault coverage with reduced I/sub DDQ/ test setsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On detecting single and multiple bridging faults in CMOS circuits using the current supply monitoring methodPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Computational complexity of controllability/observability problems for combinational circuitsIEEE Transactions on Computers, 1990
- Test generation for current testing (CMOS ICs)IEEE Design & Test of Computers, 1990
- On the complexity of computing tests for CMOS gatesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- CrossCheck: a cell based VLSI testability solutionPublished by Association for Computing Machinery (ACM) ,1989
- A CMOS fault extractor for inductive fault analysisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- SOCRATES: a highly efficient automatic test pattern generation systemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- Test Considerations for Gate Oxide Shorts in CMOS ICsIEEE Design & Test of Computers, 1986
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971