Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 432

The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.

Test set compaction algorithms for combinational circuits

Open access
Hamzaoglu, Ilker, Patel, Janak H. · 1998 · Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design - ICCAD '98

Abstract

Thispaperpresents two new algorithms, Redundant Vec-torElimination (RVE) and Essential Fault Reduction (EFR), for generating compact test sets for combinational circuits under the single stuck at fault model, and a new heuristic for estimating ihe minimum single stuck at fault test set size.7hese algon.thmstogether with the dynamic compaction algorithm are incorporated into an advancedATPG systemfor combinational circuits, called MinTest.MinTestfound better lower bounds and generated smaller test sets than the previ-OUSIJY published resultsfor the ISCAS85 andfill scan version of the ISCAS89 benchmark circuits.I

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/288548.288615

Cites

6 of 6 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 6 references

Cited by

See all 432

Metadata

Authors
Hamzaoglu, I., & Patel, J. H.
Venue
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design - ICCAD '98
Publisher
ACM Press
Published
1998
Pages
283-289
OpenAlex
W2146594632
Cited by
432
References
6
FWCI
4.74
Type
conference paper
Language
en
Open access
gold

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Test set compaction algorithms for combinational circuits. https://app.cochat.ai/papers/10.1145/288548.288615
The paper
Hamzaoglu, I., & Patel, J. H. (1998). Test set compaction algorithms for combinational circuits. Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design - ICCAD '98. https://doi.org/10.1145/288548.288615

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.