On the public citation graph
Theory of safe replacements for sequential circuits
0 signed · 55 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/3-540-58179-0_64openalex-snapshot
The verification problem for safe replaceability
inferredcites →https://doi.org/10.1007/978-0-387-35311-1_27openalex-snapshot
Sequential Logic Optimization with Implicit Retiming and Resynthesis
inferredcites →https://doi.org/10.1007/978-1-4615-0292-0_4openalex-snapshot
A Unified Framework for the Formal Verification of Sequential Circuits
inferredcites →https://doi.org/10.1007/bf00971937openalex-snapshot
Synchronizing sequences and symbolic traversal techniques in test generation
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1109/12.241596openalex-snapshot
Classification of faults in synchronous sequential circuits
inferredcites →https://doi.org/10.1109/12.481483openalex-snapshot
On removing redundancies from synchronous sequential circuits with synchronizing sequences
inferredcites →https://doi.org/10.1109/43.180261openalex-snapshot
A theory and implementation of sequential hardware equivalence
inferredcites →https://doi.org/10.1109/43.184840openalex-snapshot
Redundancy removal for sequential circuits without reset states
inferredcites →https://doi.org/10.1109/43.293952openalex-snapshot
Analysis of cyclic combinational circuits
inferredcites →https://doi.org/10.1109/43.62793openalex-snapshot
Retiming and resynthesis: optimizing sequential networks with combinational techniques
inferredcites →https://doi.org/10.1109/dac.1995.249966openalex-snapshot
The Validity of Retiming Sequential Circuits
inferredcites →https://doi.org/10.1109/dac.1996.545619openalex-snapshot
Identifying sequential redundancies without search
inferredcites →https://doi.org/10.1109/dac.1996.545665openalex-snapshot
Architectural retiming: pipelining latency-constrained circuits
inferredcites →https://doi.org/10.1109/dac.1999.781319openalex-snapshot
Performance-driven integration of retiming and resynthesis
inferredcites →https://doi.org/10.1109/eurdac.1995.527389openalex-snapshot
Exploiting power-up delay for sequential optimization
inferredcites →https://doi.org/10.1109/iccad.1989.76970openalex-snapshot
Test generation for highly sequential circuits
inferredcites →https://doi.org/10.1109/iccad.1990.129859openalex-snapshot
A unified framework for the formal verification of sequential circuits
inferredcites →https://doi.org/10.1109/iccad.1990.129861openalex-snapshot
ATPG aspects of FSM verification
inferredcites →https://doi.org/10.1109/iccad.1990.129940openalex-snapshot
Don't care minimization of multi-level sequential logic networks
inferredcites →https://doi.org/10.1109/iccad.1991.185319openalex-snapshot
Extracting local don't cares for network optimization
inferredcites →https://doi.org/10.1109/iccad.1992.279320openalex-snapshot
Performance optimization of sequential circuits by eliminating retiming bottlenecks
inferredcites →https://doi.org/10.1109/iccad.1993.580074openalex-snapshot
Sequential logic optimization by redundancy addition and removal
inferredcites →https://doi.org/10.1109/iccad.1995.479996openalex-snapshot
Be careful with don't cares
inferredcites →https://doi.org/10.1109/iccad.1996.571329openalex-snapshot
The case for retiming with explicit reset circuitry
inferredcites →https://doi.org/10.1109/iccad.1997.643522openalex-snapshot
Sequential optimisation without state space exploration
inferredcites →https://doi.org/10.1109/iccd.1991.139849openalex-snapshot
Redundancy identification and removal based on implicit state enumeration
inferredcites →https://doi.org/10.1109/iccd.1996.563590openalex-snapshot
Latch redundancy removal without global reset
inferredcites →https://doi.org/10.1109/iscas.1996.542093openalex-snapshot
Analysis of combinational cycles in sequential circuits
inferredcites →https://doi.org/10.1145/217474.217526openalex-snapshot
On test set preservation of retimed circuits
inferredcites →https://doi.org/10.1145/240518.240605openalex-snapshot
Identifying sequential redundancies without search
inferredcites →https://doi.org/10.1145/309847.309921openalex-snapshot
Performance-driven integration of retiming and resynthesis
inferredcites →https://doi.org/10.2307/2004808openalex-snapshot
Algebraic Structure Theory of Sequential Machines
inferredcites →https://doi.org/10.2307/2311171openalex-snapshot
An Introduction to the Theory of Numbers.
inferredcites →https://doi.org/10.5555/224270.224288openalex-snapshot
Exploiting power-up delay for sequential optimization
inferredcites →https://doi.org/10.5555/244522.244936openalex-snapshot
The case for retiming with explicit reset circuitry
inferredcites →https://doi.org/10.5555/259794.259846openalex-snapshot
Sequential logic optimization by redundancy addition and removal
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1109/date.2007.364453openalex-snapshot
A Compositional Approach to the Combination of Combinational and Sequential Equivalence Checking of Circuits Without Known Reset States
inferred← citeshttps://doi.org/10.1109/famcad.2007.37openalex-snapshot
Industrial Strength SAT-based Alignability Algorithm for Hardware Equivalence Verification
inferred← citeshttps://doi.org/10.1109/fmcad.2006.25openalex-snapshot
Post-reboot Equivalence and Compositional Verification of Hardware
inferred← citeshttps://doi.org/10.1109/hldvt.2005.1568813openalex-snapshot
VERISEC: VERIfying equivalence of SEquential Circuits using SAT
inferred← citeshttps://doi.org/10.1109/hldvt.2006.319985openalex-snapshot
Practical Issues in Sequential Equivalence Checking through Alignability: Handling Don't Cares and Generating Debug Traces
inferred← citeshttps://doi.org/10.1109/hldvt.2011.6114159openalex-snapshot
Sufficiency-based filtering of invariants for Sequential Equivalence Checking
inferred← citeshttps://doi.org/10.1109/iccad.2004.1382543openalex-snapshot
Theoretical framework for compositional sequential hardware equivalence verification in presence of design constraints
inferred← citeshttps://doi.org/10.1109/iccd.2006.4380826openalex-snapshot
Scalable Sequential Equivalence Checking across Arbitrary Design Transformations
inferred← citeshttps://doi.org/10.1109/tcad.2006.885832openalex-snapshot
Invariant States and Redundant Logic in Synchronous Sequential Circuits
inferred← citeshttps://doi.org/10.1109/tutcas.2003.1490926openalex-snapshot
Recent advances in verification, equivalence checking & SAT solvers
inferred← citeshttps://doi.org/10.1109/tutcas.2003.1490929openalex-snapshot
Recent advances in verification, equivalence checking & SAT solvers
inferred← citeshttps://doi.org/10.1145/1391469.1391506openalex-snapshot
Compositional verification of retiming and sequential optimizations
inferred← citeshttps://doi.org/10.1145/762488.762493openalex-snapshot
Sequential optimization in the absence of global reset
inferred← citeshttps://doi.org/10.5555/1266366.1266619openalex-snapshot
A compositional approach to the combination of combinational and sequential equivalence checking of circuits without known reset states
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.