On the public citation graph
A theory and implementation of sequential hardware equivalence
0 signed · 104 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.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.1090/dimacs/003/20openalex-snapshot
A computation theory and implementation of sequential hardware equivalence
inferredcites →https://doi.org/10.1109/dac.1990.114826openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1109/iccad.1988.122450openalex-snapshot
Evaluation and improvement of Boolean comparison method based on binary decision diagrams
inferredcites →https://doi.org/10.1109/iccad.1988.122451openalex-snapshot
Logic verification using binary decision diagrams in a logic synthesis environment
inferredcites →https://doi.org/10.1109/iccad.1989.76938openalex-snapshot
State assignment for initializable synthesis (gate level analysis)
inferredcites →https://doi.org/10.1109/iccad.1990.129860openalex-snapshot
Implicit state enumeration of finite state machines using BDD's
inferredcites →https://doi.org/10.1109/iccad.1990.129861openalex-snapshot
ATPG aspects of FSM verification
inferredcites →https://doi.org/10.1109/iccad.1991.185308openalex-snapshot
Variable ordering and selection of FSM traversal
inferredcites →https://doi.org/10.1109/iccd.1991.139891openalex-snapshot
Automatic derivation of FSM specification to implementation encoding
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/37888.37929openalex-snapshot
On the verification of sequential machines at differing levels of abstraction
inferredcites →https://doi.org/10.1145/567067.567080openalex-snapshot
Automatic verification of finite state concurrent system using temporal logic specifications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_3openalex-snapshot
Automated temporal reasoning about reactive systems
inferred← citeshttps://doi.org/10.1007/978-1-4615-0817-5_13openalex-snapshot
Combinational and Sequential Equivalence Checking
inferred← citeshttps://doi.org/10.1007/978-3-031-71177-0_13openalex-snapshot
Compositional Verification of Cryptographic Circuits Against Fault Injection Attacks
inferred← citeshttps://doi.org/10.1007/978-3-540-30494-4_28openalex-snapshot
A Partitioning Methodology for BDD-Based Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_27openalex-snapshot
On Some Transformation Invariants Under Retiming and Resynthesis
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_42openalex-snapshot
Functional Verification of Power Gated Designs by Compositional Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-75867-9_64openalex-snapshot
A Compositional Approach for Equivalence Checking of Sequential Circuits with Unknown Reset State and Overlapping Partitions
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_3openalex-snapshot
On Formal Equivalence Verification of Hardware
inferred← citeshttps://doi.org/10.1007/978-981-95-3643-6_3openalex-snapshot
Sequential Equivalence Checking for Specialized IR via Instrumentation-Based Symbolic Execution
inferred← citeshttps://doi.org/10.1007/s00236-014-0203-0openalex-snapshot
Formal communication elimination and sequentialization equivalence proofs for distributed system models
inferred← citeshttps://doi.org/10.1007/s10617-008-9033-zopenalex-snapshot
Sequential equivalence checking between system level and RTL descriptions
inferred← citeshttps://doi.org/10.1007/s10703-009-0077-xopenalex-snapshot
Functional verification of power gated designs by compositional reasoning
inferred← citeshttps://doi.org/10.1007/s10703-023-00414-1openalex-snapshot
Achieving high coverage in hardware equivalence checking via concolic verification
inferred← citeshttps://doi.org/10.1016/b978-0-12-370616-4.x5001-0openalex-snapshot
Verification Techniques for System-Level Design
inferred← citeshttps://doi.org/10.1016/b978-0-12-800727-3.00008-3openalex-snapshot
Formal equivalence verification
inferred← citeshttps://doi.org/10.1016/b978-0-323-95612-3.00008-2openalex-snapshot
Formal equivalence verification
inferred← citeshttps://doi.org/10.1016/b978-012370616-4.50005-7openalex-snapshot
Verification Algorithms for FSM Models
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82545-9openalex-snapshot
SAT-Based Methods for Sequential Hardware Equivalence Verification without Synchronization
inferred← citeshttps://doi.org/10.1090/dimacs/031openalex-snapshot
Descriptive Complexity and Finite Models
inferred← citeshttps://doi.org/10.1109/12.481483openalex-snapshot
On removing redundancies from synchronous sequential circuits with synchronizing sequences
inferred← citeshttps://doi.org/10.1109/12.859539openalex-snapshot
AQUILA: an equivalence checking system for large sequential designs
inferred← citeshttps://doi.org/10.1109/43.552081openalex-snapshot
Markovian analysis of large finite state machines
inferred← citeshttps://doi.org/10.1109/43.631217openalex-snapshot
Behavior and testability preservation under the retiming transformation
inferred← citeshttps://doi.org/10.1109/43.644605openalex-snapshot
Logic decomposition during technology mapping
inferred← citeshttps://doi.org/10.1109/43.908455openalex-snapshot
Theory of safe replacements for sequential circuits
inferred← citeshttps://doi.org/10.1109/54.936244openalex-snapshot
Applied Boolean equivalence verification and RTL static sign-off
inferred← citeshttps://doi.org/10.1109/acsd.2009.18openalex-snapshot
Model Checking Verilog Descriptions of Cell Libraries
inferred← citeshttps://doi.org/10.1109/aspdac.1997.600302openalex-snapshot
AQUILA: An equivalence verifier for large sequential circuits
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.1995.249966openalex-snapshot
The Validity of Retiming Sequential Circuits
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/eurdac.1995.527389openalex-snapshot
Exploiting power-up delay for sequential optimization
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/fmcad.2009.5351129openalex-snapshot
A compositional theory for post-reboot observational equivalence checking of hardware
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351131openalex-snapshot
Scalable conditional equivalence checking: An automated invariant-generation based approach
inferred← citeshttps://doi.org/10.1109/hldvt.2005.1568811openalex-snapshot
Establishing latch correspondence for embedded circuits of PowerPC microprocessors
inferred← citeshttps://doi.org/10.1109/hldvt.2005.1568812openalex-snapshot
Sequential equivalence checking based on k-th invariants and circuit SAT solving
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.2008.4695876openalex-snapshot
Janus: A novel use of Formal Verification for targeted behavioral equivalence
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/hldvt.2012.6418236openalex-snapshot
Sequential equivalence checking of hard instances with targeted inductive invariants and efficient filtering strategies
inferred← citeshttps://doi.org/10.1109/iccad.1994.629841openalex-snapshot
Multi-Level Synthesis For Safe Replaceability
inferred← citeshttps://doi.org/10.1109/iccad.1996.569807openalex-snapshot
Using Complete-1-Distinguishability for FSM 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/iccad.2005.1560201openalex-snapshot
Embedded tutorial: formal equivalence checking between system-level models and RTL
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397277openalex-snapshot
Computation of minimal counterexamples by using black box techniques and symbolic methods
inferred← citeshttps://doi.org/10.1109/iccd.2006.4380826openalex-snapshot
Scalable Sequential Equivalence Checking across Arbitrary Design Transformations
inferred← citeshttps://doi.org/10.1109/iccd.2006.4380827openalex-snapshot
Seqver : A Sequential Equivalence Verifier for Hardware Designs
inferred← citeshttps://doi.org/10.1109/icvd.1996.489495openalex-snapshot
On finding functionally identical and functionally opposite lines in combinational logic circuits
inferred← citeshttps://doi.org/10.1109/isqed.2008.4479812openalex-snapshot
2D Decomposition Sequential Equivalence Checking of System Level and RTL Descriptions
inferred← citeshttps://doi.org/10.1109/isqed.2008.4479838openalex-snapshot
A Basis for Formal Robustness Checking
inferred← citeshttps://doi.org/10.1109/mdt.2005.68openalex-snapshot
Principles of Sequential-Equivalence Verification
inferred← citeshttps://doi.org/10.1109/mtv.2008.8openalex-snapshot
Preparing Rearchitected Designs for Sequential Equivalence Checking
inferred← citeshttps://doi.org/10.1109/rsp.2009.21openalex-snapshot
WoLFram- A Word Level Framework for Formal Verification
inferred← citeshttps://doi.org/10.1109/tcad.2003.811446openalex-snapshot
On the verification of sequential equivalence
inferred← citeshttps://doi.org/10.1109/tcad.2006.882520openalex-snapshot
Retiming and Resynthesis: A Complexity Perspective
inferred← citeshttps://doi.org/10.1109/test.1994.528050openalex-snapshot
On achieving complete testability of synchronous sequential circuits with synchronizing sequences
inferred← citeshttps://doi.org/10.1109/test.1996.557148openalex-snapshot
An ATPG-based framework for verifying sequential equivalence
inferred← citeshttps://doi.org/10.1109/tlt.2017.2723389openalex-snapshot
Jutge.org : Characteristics and Experiences
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.1109/tvlsi.2008.2005311openalex-snapshot
SEChecker: A Sequential Equivalence Checking Framework Based on ${K}$th Invariants
inferred← citeshttps://doi.org/10.1109/vtest.1998.670866openalex-snapshot
Undetectable fault removal of sequential circuits based on unreachable states
inferred← citeshttps://doi.org/10.1109/vts.2002.1011136openalex-snapshot
Theorems for efficient identification of indistinguishable fault pairs in synchronous sequential circuits
inferred← citeshttps://doi.org/10.1109/wintechcon55229.2022.9832102openalex-snapshot
Deploying SEC for Design Cycle Time Reduction and Quality Improvement
inferred← citeshttps://doi.org/10.1145/1391469.1391506openalex-snapshot
Compositional verification of retiming and sequential optimizations
inferred← citeshttps://doi.org/10.1145/1629911.1630033openalex-snapshot
Non-cycle-accurate sequential equivalence checking
inferred← citeshttps://doi.org/10.1145/196244.196374openalex-snapshot
Probabilistic analysis of large finite state machines
inferred← citeshttps://doi.org/10.1145/277044.277203openalex-snapshot
An implicit algorithm for finding steady states and its application to FSM verification
inferred← citeshttps://doi.org/10.1145/288548.288593openalex-snapshot
Dynamic fault collapsing and diagnostic test pattern generation for sequential circuits
inferred← citeshttps://doi.org/10.1145/288548.289086openalex-snapshot
Efficient equivalence checking of multi-phase designs using retiming
inferred← citeshttps://doi.org/10.1145/296333.296348openalex-snapshot
Efficient equivalence checking of multi-phase designs using phase abstraction and retiming
inferred← citeshttps://doi.org/10.1145/337292.337613openalex-snapshot
Analysis of composition complexity and how to obtain smaller canonical graphs
inferred← citeshttps://doi.org/10.1145/375977.376022openalex-snapshot
Verifying sequential equivalence using ATPG techniques
inferred← citeshttps://doi.org/10.1145/502175.502183openalex-snapshot
Using complete-1-distinguishability for FSM equivalence checking
inferred← citeshttps://doi.org/10.1145/762488.762493openalex-snapshot
Sequential optimization in the absence of global reset
inferred← citeshttps://doi.org/10.21236/ada351548openalex-snapshot
Dynamic Fault Collapsing and Diagnostic Test Pattern Generation for Sequential Circuits
inferred← citeshttps://doi.org/10.23919/date.2019.8715131openalex-snapshot
High Coverage Concolic Equivalence Checking
inferred← citeshttps://doi.org/10.4204/eptcs.156.7openalex-snapshot
RTL2RTL Formal Equivalence: Boosting the Design Confidence
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
inferred← citeshttps://doi.org/10.5555/191326.191510openalex-snapshot
Multi-level synthesis for safe replaceability
inferred← citeshttps://doi.org/10.5555/224270.224288openalex-snapshot
Exploiting power-up delay for sequential optimization
inferred← citeshttps://doi.org/10.5555/244522.244829openalex-snapshot
Using complete-1-distinguishability for FSM equivalence checking
inferred← citeshttps://doi.org/10.6100/ir496632openalex-snapshot
Formal methods for the verification of digital circuits
inferred← citeshttps://doi.org/10.70675/b48960fdz8d45z48f9za370z38575e4129b0openalex-snapshot
Strengthening fonctional validation of critical system by using Model Checking : application to Instrumentation and control systems in nuclear power plants
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.