The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Cost-effective generation of minimal test sets for stuck-at faults in combinational logic circuits
Abstract
This paper presents new cost-effective heuristics for the generation of minimal test sets. Both dynamic techniques, which are introduced into the test generation process, and a static technique, which is applied to already generated test sets, are used. The dynamic compaction techniques maximize the number of faults that a new test vector detects out of the yet-undetected faults as well as out of the already-detected ones. Thus, they reduce the number of tests and allow tests generated earlier in the test generation process to be dropped. The static compaction technique replaces N test vectors by M < N test vectors, without loss of fault coverage. During test generation, we also find a lower bound on test set size. Experimental results demonstrate the effectiveness of the proposed techniques.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Combinational profiles of sequential benchmark circuits
Brglez, F., Bryan, D., & Kozminski, K. (2003) · IEEE International Symposium on Circuits and Systems · doi:10.1109/iscas.1989.100747 · Cited by 2,095
Cited by
Test set compaction algorithms for combinational circuits
Hamzaoglu, I., & Patel, J. H. (1998) · Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design - ICCAD '98 · doi:10.1145/288548.288615 · Cited by 432
Metadata
- Authors
- Kajihara, S., Pomeranz, I., Kinoshita, K., & Reddy, S. M.
- Venue
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Published
- 1995
- Volume
- 14
- Issue
- 12
- Pages
- 1496-1504
- ISSN
- 0278-0070 (ISSN-L)
- OpenAlex
- W2151526282
- Cited by
- 222
- References
- 1
- FWCI
- 3.26
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.