The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
On the Acceleration of Test Generation Algorithms
Abstract
In 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 and present a new test generation algorithm called FAN (fan-out-oriented test generation algorithm). It is shown that the FAN algorithm is faster and more efficient than the PODEM algorithm reported by Goel. We also present an automatic test generation system composed of the FAN algorithm and the concurrent fault simulation. Experimental results on large combinational circuits of up to 3000 gates demonstrate that the system performs test generation very fast and effectively.
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
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
Goel (1981) · IEEE Transactions on Computers · doi:10.1109/tc.1981.1675757 · Cited by 1,122
Test generation systems in Japan
Funatsu, S., Wakatsuki, N., & Arima, T. (1975) · ACM/IEEE Design Automation Conference (DAC) · doi:10.5555/800261.809058 · Cited by 89
Cited by
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
Test pattern generation using Boolean satisfiability
Larrabee, T. (1992) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.108614 · Cited by 703
HITEC: a test generation package for sequential circuits
Niermann, T., & Patel, J. H. (2002) · Proceedings of the European Conference on Design Automation. · doi:10.1109/edac.1991.206393 · Cited by 522
A survey of recent advances in SAT-based formal verification
Prasad, M. R., Biere, A., & Gupta, A. (2005) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-004-0183-4 · Cited by 279
COMPACTEST: A METHOD TO GENERATE COMPACT TEST SETS FOR COMBINATIONAL CIRCUITS
Pomeranz, I., Reddy, L. N., & Reddy, S. M. (2005) · 1991, Proceedings. International Test Conference · doi:10.1109/test.1991.519510 · Cited by 261
Metadata
- Authors
- Fujiwara, & Shimono
- Venue
- IEEE Transactions on Computers
- Published
- 1983-12
- Volume
- C-32
- Issue
- 12
- Pages
- 1137-1144
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2173124859
- Cited by
- 822
- References
- 2
- FWCI
- 9.60
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Acceleration of Test Generation Algorithms. https://app.cochat.ai/papers/10.1109/tc.1983.1676174
- The paper
- Fujiwara, & Shimono. (1983). On the Acceleration of Test Generation Algorithms. IEEE Transactions on Computers. https://doi.org/10.1109/tc.1983.1676174
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.