On the public citation graph

On local transformations and path delay fault testability

0 signed · 38 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-4613-2821-6openalex-snapshot
Logic Minimization Algorithms for VLSI Synthesis
inferredcites →https://doi.org/10.1016/0167-9260(93)90002-topenalex-snapshot
Path-delay-fault testability properties of multiplexor-based networks
inferredcites →https://doi.org/10.1016/0377-2217(90)90290-ropenalex-snapshot
Digital Systems : Testing and Testable Design
inferredcites →https://doi.org/10.1109/12.536242openalex-snapshot
Synthesis of delay fault testability circuits
inferredcites →https://doi.org/10.1109/12.73590openalex-snapshot
On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
inferredcites →https://doi.org/10.1109/43.88928openalex-snapshot
DYNAMITE: an efficient automatic test pattern generation system for path delay faults
inferredcites →https://doi.org/10.1109/9780470544389openalex-snapshot
Digital Systems Testing and Testable Design
inferredcites →https://doi.org/10.1109/edac.1990.136640openalex-snapshot
A graphical system for hierarchical specifications and checkups of VLSI circuits
inferredcites →https://doi.org/10.1109/ftcs.1988.5323openalex-snapshot
On the design of robust testable CMOS combinational logic circuits
inferredcites →https://doi.org/10.1109/ftcs.1990.89391openalex-snapshot
On the design of path delay fault testable combinational circuits
inferredcites →https://doi.org/10.1109/ftcs.1992.243573openalex-snapshot
Synthesis of multi-level combinational circuits for complete robust path delay fault testability
inferredcites →https://doi.org/10.1109/iccad.1989.76982openalex-snapshot
Synthesis of delay fault testable combinational logic
inferredcites →https://doi.org/10.1109/iccad.1990.129952openalex-snapshot
Testability-preserving circuit transformations
inferredcites →https://doi.org/10.1109/icvd.1994.282669openalex-snapshot
Testability properties of local circuit transformations with respect to the robust path-delay-fault model
inferredcites →https://doi.org/10.1109/iscas.1989.100747openalex-snapshot
Combinational profiles of sequential benchmark circuits
inferredcites →https://doi.org/10.1109/iscas.1990.112669openalex-snapshot
Synthesis of combinational logic circuits for path delay fault testability
inferredcites →https://doi.org/10.1109/pgec.1966.264376openalex-snapshot
On Finding a Nearly Minimal Set of Fault Detection Tests for Combinational Logic Nets
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1109/test.1990.114032openalex-snapshot
Testability preserving transformations in multi-level logic synthesis
inferredcites →https://doi.org/10.1109/vtest.1993.313336openalex-snapshot
Testability preserving Boolean transforms for logic synthesis
inferredcites →https://doi.org/10.1109/vtest.1995.512665openalex-snapshot
On the application of local circuit transformations with special emphasis on path delay fault testability
inferredcites →https://doi.org/10.1145/12130.12134openalex-snapshot
Two lower bounds for branching programs
inferredcites →https://doi.org/10.1145/123186.123262openalex-snapshot
Synthesis and optimization procedures for robustly delay-fault testable combinational logic circuits
inferredcites →https://doi.org/10.1145/42282.46161openalex-snapshot
On the complexity of branching programs and decision trees for clique functions
inferredcites →https://doi.org/10.5555/198174.198276openalex-snapshot
BiTeS: a BDD based test pattern generator for strong robust path delay faults

What points at this work

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

inferred← citeshttps://doi.org/10.1016/s0167-9260(98)00019-4openalex-snapshot
Delay fault models for VLSI circuits
inferred← citeshttps://doi.org/10.1023/a:1008316631868openalex-snapshot
False-Path Removal Using Delay Fault Simulation
inferred← citeshttps://doi.org/10.1109/43.703921openalex-snapshot
LOT: Logic Optimization with Testability. New transformations for logic synthesis
inferred← citeshttps://doi.org/10.1109/ats.1998.741593openalex-snapshot
False-path removal using delay fault simulation
inferred← citeshttps://doi.org/10.1109/date.2012.6176505openalex-snapshot
Test generation for clock-domain crossing faults in integrated circuits
inferred← citeshttps://doi.org/10.1109/lats65346.2025.10963945openalex-snapshot
Preserving and Improving Verifiability of Circuits Based on Local Transformations
inferred← citeshttps://doi.org/10.1109/test.1996.556981openalex-snapshot
Local transformations and robust dependent path delay faults
inferred← citeshttps://doi.org/10.1109/test.1996.556982openalex-snapshot
On cancelling the effects of logic sharing for improved path delay fault testability
inferred← citeshttps://doi.org/10.1109/vlsi.2008.22openalex-snapshot
Design-for-Testability for Improved Path Delay Fault Coverage of Critical Paths
inferred← citeshttps://doi.org/10.1109/vtest.1998.670869openalex-snapshot
Improving path delay fault testability by path removal
inferred← citeshttps://doi.org/10.1109/vts.2008.10openalex-snapshot
Synthesis for Broadside Testability of Transition Faults
inferred← citeshttps://doi.org/10.5555/2492708.2492811openalex-snapshot
Test generation for clock-domain crossing faults in integrated circuits
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.