On the public citation graph
A novel framework for logic verification in a synthesis environment
0 signed · 59 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4615-0292-0_3openalex-snapshot
Functional Comparison of Logic Designs for VLSI Circuits
inferredcites →https://doi.org/10.1109/12.35836openalex-snapshot
The transduction method-design of logic networks based on permissible functions
inferredcites →https://doi.org/10.1109/43.310903openalex-snapshot
Recursive learning: a new implication technique for efficient solutions to CAD problems-test, verification, and optimization
inferredcites →https://doi.org/10.1109/43.3140openalex-snapshot
SOCRATES: a highly efficient automatic test pattern generation system
inferredcites →https://doi.org/10.1109/dac.1990.114826openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1109/dac.1995.249984openalex-snapshot
Advanced Verification Techniques Based on Learning
inferredcites →https://doi.org/10.1109/edac.1993.386497openalex-snapshot
Methods for automatic design error correction in sequential circuits
inferredcites →https://doi.org/10.1109/edtc.1994.326921openalex-snapshot
Minimizing ROBDD size of incompletely specified multiple output functions
inferredcites →https://doi.org/10.1109/euasic.1992.228029openalex-snapshot
Quantifying design quality: a model and design experiments
inferredcites →https://doi.org/10.1109/ftcsh.1995.532658openalex-snapshot
ON THE ACCELERATION OF TEST GENERATION ALGORlTHMS
inferredcites →https://doi.org/10.1109/iccad.1989.76990openalex-snapshot
Functional comparison of logic designs for VLSI circuits
inferredcites →https://doi.org/10.1109/iccad.1993.580104openalex-snapshot
On diagnosis and correction of design errors
inferredcites →https://doi.org/10.1109/iccad.1993.580110openalex-snapshot
Verification of large synthesized designs
inferredcites →https://doi.org/10.1109/iccad.1993.580111openalex-snapshot
HANNIBAL: An efficient tool for logic verification based on recursive learning
inferredcites →https://doi.org/10.1109/iccad.1993.580112openalex-snapshot
Probabilistic construction and manipulation of Free Boolean Diagrams
inferredcites →https://doi.org/10.1109/iccad.1994.629735openalex-snapshot
Multi-level Logic Optimization By Implication Analysis
inferredcites →https://doi.org/10.1109/iccad.1995.480135openalex-snapshot
LOT: Logic optimization with testability - new transformations using recursive learning
inferredcites →https://doi.org/10.1109/iccd.1991.139937openalex-snapshot
Logic synthesis of 100-percent testable logic networks
inferredcites →https://doi.org/10.1109/tc.1983.1676174openalex-snapshot
On the Acceleration of Test Generation Algorithms
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/123186.123222openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1145/196244.196360openalex-snapshot
Heuristic minimization of BDDs using don't cares
inferredcites →https://doi.org/10.1145/196244.196444openalex-snapshot
Efficient representation and manipulation of switching functions based on ordered Kronecker functional decision diagrams
inferredcites →https://doi.org/10.1145/217474.217564openalex-snapshot
Advanced verification techniques based on learning
inferredcites →https://doi.org/10.5555/259794.259883openalex-snapshot
Verification of large synthesized designs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.mee.2006.02.007openalex-snapshot
Fast co-verification of HDL models
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00331-7openalex-snapshot
Formal Verification based on Boolean Expression Diagrams
inferred← citeshttps://doi.org/10.1023/a:1008302118244openalex-snapshot
Logic Design Validation via Simulation and Automatic Test Pattern Generation
inferred← citeshttps://doi.org/10.1023/a:1008349024680openalex-snapshot
An Efficient Logic Equivalence Checker for Industrial Circuits
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/43.771175openalex-snapshot
Equivalence checking of combinational circuits using Boolean expression diagrams
inferred← citeshttps://doi.org/10.1109/43.863644openalex-snapshot
VERILAT: Verification by Logic Augmentation and Transformation
inferred← citeshttps://doi.org/10.1109/aspdac.2003.1194999openalex-snapshot
Logic verification based on diagnosis techniques
inferred← citeshttps://doi.org/10.1109/ats.2010.81openalex-snapshot
Mining Complex Boolean Expressions for Sequential Equivalence Checking
inferred← citeshttps://doi.org/10.1109/dac.2003.1219042openalex-snapshot
Solving the latch mapping problem in an industrial setting
inferred← citeshttps://doi.org/10.1109/dac.2003.1219133openalex-snapshot
Learning from BDDs in SAT-based bounded model checking
inferred← citeshttps://doi.org/10.1109/dac.2006.229319openalex-snapshot
Mining global constraints for improving bounded sequential equivalence checking
inferred← citeshttps://doi.org/10.1109/icasic.2001.982529openalex-snapshot
EVBCS: new equivalence verification algorithm based on OBDD and circuit structure
inferred← citeshttps://doi.org/10.1109/iccad.1996.569111openalex-snapshot
VERILAT: verification using logic augmentation and transformations
inferred← citeshttps://doi.org/10.1109/iccad.1997.643607openalex-snapshot
A SAT-based implication engine for efficient ATPG, equivalence checking, and optimization of netlists
inferred← citeshttps://doi.org/10.1109/icccas.2002.1179038openalex-snapshot
Technology mapping and Hadamard transform
inferred← citeshttps://doi.org/10.1109/icics.1997.647096openalex-snapshot
Decision diagrams and AND/OR graphs for design automation problems
inferred← citeshttps://doi.org/10.1109/icvd.2001.902656openalex-snapshot
A graph traversal based framework for sequential logic implication with an application to C-cycle redundancy identification
inferred← citeshttps://doi.org/10.1109/mtv.2004.18openalex-snapshot
On the impact of structural circuit partitioning on SAT-based combinational circuit verification
inferred← citeshttps://doi.org/10.1109/olt.2001.937820openalex-snapshot
Logic insertion to speed-up logic verification: a recent development
inferred← citeshttps://doi.org/10.1109/tutcas.2003.1490928openalex-snapshot
VERILAT: verification using logic augmentation and transformations
inferred← citeshttps://doi.org/10.1145/1119772.1119791openalex-snapshot
Logic verification based on diagnosis techniques
inferred← citeshttps://doi.org/10.1145/1146909.1147098openalex-snapshot
Mining global constraints for improving bounded sequential equivalence checking
inferred← citeshttps://doi.org/10.1145/288548.289088openalex-snapshot
Tight integration of combinational verification methods
inferred← citeshttps://doi.org/10.1145/775832.775948openalex-snapshot
Solving the latch mapping problem in an industrial setting
inferred← citeshttps://doi.org/10.1145/775832.776040openalex-snapshot
Learning from BDDs in SAT-based bounded model checking
inferred← citeshttps://doi.org/10.5555/244522.244537openalex-snapshot
VERILAT: verification using logic augmentation and transformations
inferred← citeshttps://doi.org/10.5555/266388.266400openalex-snapshot
PHDD: an efficient graph representation for floating point circuit verification
inferred← citeshttps://doi.org/10.5555/266388.266569openalex-snapshot
A SAT-based implication engine for efficient ATPG, equivalence checking, and optimization of netlists
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.