On the public citation graph

Computing optimal test sequences from complete test sets for stuck-open faults in CMOS circuits

0 signed · 36 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1978.tb02106.xopenalex-snapshot
Fault Modeling and Logic Simulation of CMOS and MOS Integrated Circuits
inferredcites →https://doi.org/10.1007/978-1-4612-4400-4openalex-snapshot
The Design and Analysis of Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-95424-5openalex-snapshot
Diagnosis & Reliable Design of Digital Systems
inferredcites →https://doi.org/10.1016/0022-0000(80)90004-5openalex-snapshot
On finding minimal length superstrings
inferredcites →https://doi.org/10.1016/0890-5401(89)90044-8openalex-snapshot
Approximation algorithms for the shortest common superstring problem
inferredcites →https://doi.org/10.1038/scientificamerican0984-60openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1109/12.24296openalex-snapshot
The complexity of generating minimum test sets for PLA's and monotone combinational circuits
inferredcites →https://doi.org/10.1109/43.35549openalex-snapshot
On the complexity of computing tests for CMOS gates
inferredcites →https://doi.org/10.1109/43.46808openalex-snapshot
Computing optimal test sequences from complete test sets for stuck-open faults in CMOS circuits
inferredcites →https://doi.org/10.1109/dac.1983.1585625openalex-snapshot
On Fault Detection in CMOS Logic Networks
inferredcites →https://doi.org/10.1109/dac.1984.1585845openalex-snapshot
A Gate Level Model for CMOS Combinational Logic Circuits with Application to Fault Detection
inferredcites →https://doi.org/10.1109/tc.1980.1675614openalex-snapshot
Physical Versus Logical Fault Models MOS LSI Circuits: Impact on Their Testability
inferredcites →https://doi.org/10.1109/tc.1985.1676582openalex-snapshot
Modeling and Test Generation Algorithms for MOS Circuits
inferredcites →https://doi.org/10.1109/tc.1986.1676825openalex-snapshot
Testable Realizations for FET Stuck-Open Faults in CMOS Combinational Logic Circuits
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
inferredcites →https://doi.org/10.5555/800032.800640openalex-snapshot
On Fault Detection in CMOS Logic Networks
inferredcites →https://doi.org/10.5555/800033.800846openalex-snapshot
A Gate Level Model for CMOS Combinational Logic Circuits with Application to Fault Detection

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/bf00971961openalex-snapshot
Design of a C-testable booth multiplier using a realistic fault model
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.12.3506openalex-snapshot
Maximizing Stuck-Open Fault Coverage Using Stuck-at Test Vectors
inferred← citeshttps://doi.org/10.1109/43.293951openalex-snapshot
Cellular automata based deterministic self-test strategies for programmable data paths
inferred← citeshttps://doi.org/10.1109/43.833205openalex-snapshot
On n-detection test sets and variable n-detection test sets for transition faults
inferred← citeshttps://doi.org/10.1109/ats.1995.485340openalex-snapshot
Static compaction for two-pattern test sets
inferred← citeshttps://doi.org/10.1109/ats.2008.39openalex-snapshot
Increasing Defect Coverage by Generating Test Vectors for Stuck-Open Faults
inferred← citeshttps://doi.org/10.1109/dac.1990.114936openalex-snapshot
SOPRANO: an efficient automatic test pattern generator for stuck-open faults in CMOS combinational circuits
inferred← citeshttps://doi.org/10.1109/ftcs.1993.627320openalex-snapshot
EXOP (Extended Operation): A new logical fault model for digital circuits
inferred← citeshttps://doi.org/10.1109/glsv.1996.497634openalex-snapshot
On double transition faults as a delay fault model
inferred← citeshttps://doi.org/10.1109/tcad.2009.2013281openalex-snapshot
Double–Single Stuck-at Faults: A Delay Fault Model for Synchronous Sequential Circuits
inferred← citeshttps://doi.org/10.1109/tencon.1994.369196openalex-snapshot
A layout driven test generation for CMOS combinational circuits
inferred← citeshttps://doi.org/10.1109/test.1998.743288openalex-snapshot
Compact two-pattern test set generation for combinational and full scan circuits
inferred← citeshttps://doi.org/10.1109/vtest.1992.232716openalex-snapshot
Generalization of independent faults for transition faults
inferred← citeshttps://doi.org/10.1109/vtest.1999.766662openalex-snapshot
On n-detection test sets and variable n-detection test sets for transition faults
inferred← citeshttps://doi.org/10.1145/123186.123432openalex-snapshot
SOPRANO
inferred← citeshttps://doi.org/10.1145/1640457.1640464openalex-snapshot
Using stuck-at tests to form scan-based tests for transition faults in standard-scan circuits
inferred← citeshttps://doi.org/10.1155/1994/71941openalex-snapshot
An Efficient Automatic Test Pattern Generator forStuck‐Open Faults in CMOS Combinational Circuits
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.3128openalex-snapshot
Addressing Defect Coverage through Generating Test Vectors for Transistor Defects
showing the first 18 of 19 · page through all 19
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.