On the public citation graph

Sequential equivalence checking based on structural similarities

0 signed · 114 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.1007/3-540-52148-8_30openalex-snapshot
Verification of synchronous sequential machines based on symbolic execution
inferredcites →https://doi.org/10.1016/s0898-1221(97)80237-4openalex-snapshot
Reasoning in boolean networks: Logic synthesis and verification using testing techniques
inferredcites →https://doi.org/10.1109/43.275352openalex-snapshot
Symbolic model checking for sequential circuit verification
inferredcites →https://doi.org/10.1109/aspdac.1997.600302openalex-snapshot
AQUILA: An equivalence verifier for large sequential circuits
inferredcites →https://doi.org/10.1109/dac.1995.249984openalex-snapshot
Advanced Verification Techniques Based on Learning
inferredcites →https://doi.org/10.1109/dac.1997.597155openalex-snapshot
Equivalence Checking Using Cuts And Heaps
inferredcites →https://doi.org/10.1109/dac.1997.597241openalex-snapshot
Disjunctive Partitioning And Partial Iterative Squaring: An Effective Approach For Symbolic Traversal Of Large Circuits
inferredcites →https://doi.org/10.1109/date.1999.761109openalex-snapshot
Using combinational verification for sequential circuits
inferredcites →https://doi.org/10.1109/edtc.1995.470405openalex-snapshot
Improving initialization through reversed retiming
inferredcites →https://doi.org/10.1109/edtc.1996.494119openalex-snapshot
Exploiting functional dependencies in finite state machine verification
inferredcites →https://doi.org/10.1109/eurdac.1996.558199openalex-snapshot
Incremental re-encoding for symbolic traversal of product machines
inferredcites →https://doi.org/10.1109/glsv.1996.497633openalex-snapshot
On verifying the correctness of retimed circuits
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.1993.580110openalex-snapshot
Verification of large synthesized designs
inferredcites →https://doi.org/10.1109/iccad.1996.569111openalex-snapshot
VERILAT: verification using logic augmentation and transformations
inferredcites →https://doi.org/10.1109/iccad.1996.569807openalex-snapshot
Using Complete-1-Distinguishability for FSM equivalence checking
inferredcites →https://doi.org/10.1109/iccad.1997.643566openalex-snapshot
Record and play: a structural fixed point iteration for sequential circuit verification
inferredcites →https://doi.org/10.1145/157485.164555openalex-snapshot
Algorithms for approximate FSM traversal
inferredcites →https://doi.org/10.1145/217474.217564openalex-snapshot
Advanced verification techniques based on learning
inferredcites →https://doi.org/10.1145/240518.240637openalex-snapshot
An efficient equivalence checker for combinational circuits
inferredcites →https://doi.org/10.1145/266021.266090openalex-snapshot
Equivalence checking using cuts and heaps
inferredcites →https://doi.org/10.1145/266021.266355openalex-snapshot
Disjunctive partitioning and partial iterative squaring
inferredcites →https://doi.org/10.1145/288548.289053openalex-snapshot
Approximate reachability don't cares for CTL model checking
inferredcites →https://doi.org/10.1145/288548.289055openalex-snapshot
Verification by approximate forward and backward reachability
inferredcites →https://doi.org/10.1145/288548.289087openalex-snapshot
Robust latch mapping for combinational equivalence checking
inferredcites →https://doi.org/10.1145/288548.289088openalex-snapshot
Tight integration of combinational verification methods
inferredcites →https://doi.org/10.1145/307418.307476openalex-snapshot
Using combinational verification for sequential circuits
inferredcites →https://doi.org/10.5555/244522.244537openalex-snapshot
VERILAT: verification using logic augmentation and transformations
inferredcites →https://doi.org/10.5555/244522.244829openalex-snapshot
Using complete-1-distinguishability for FSM equivalence checking
inferredcites →https://doi.org/10.5555/259794.259883openalex-snapshot
Verification of large synthesized designs
inferredcites →https://doi.org/10.5555/266388.266514openalex-snapshot
Record & play: a structural fixed point iteration for sequential circuit verification
inferredcites →https://doi.org/10.5555/787258.787431openalex-snapshot
Improving initialization through reversed retiming
inferredcites →https://doi.org/10.5555/787259.787608openalex-snapshot
Exploiting functional dependencies in finite state machine verification
inferredcites →https://doi.org/10.6100/ir496632openalex-snapshot
Formal methods for the verification of digital circuits

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4419-7518-8_3openalex-snapshot
Sequential Logic Synthesis Using Symbolic Bi-decomposition
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-319-10575-8_10openalex-snapshot
SAT-Based Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-13338-6_5openalex-snapshot
Generating Modulo-2 Linear Invariants for Hardware Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_21openalex-snapshot
Functional Dependency for Verification Reduction
inferred← citeshttps://doi.org/10.1007/978-3-540-30494-4_10openalex-snapshot
Late Design Changes (ECOs) for Sequentially Optimized Esterel Designs
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-642-28872-2_28openalex-snapshot
On the Danger of Coverage Directed Test Case Generation
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_29openalex-snapshot
Blocked Clause Decomposition
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-017-0293-8openalex-snapshot
Automating regression verification of pointer programs by predicate abstraction
inferred← citeshttps://doi.org/10.1007/s10703-023-00433-yopenalex-snapshot
Enhancing active model learning with equivalence checking using simulation relations
inferred← citeshttps://doi.org/10.1016/j.vlsi.2026.102747openalex-snapshot
Accelerating hardware formal verification via AutoML-driven SMT runtime prediction and solver selection
inferred← citeshttps://doi.org/10.1049/iet-cdt.2010.0048openalex-snapshot
Verification by parts: reusing component invariant checking results
inferred← citeshttps://doi.org/10.1109/acsd.2009.18openalex-snapshot
Model Checking Verilog Descriptions of Cell Libraries
inferred← citeshttps://doi.org/10.1109/ase.2015.64openalex-snapshot
Executing Model-Based Tests on Platform-Specific Implementations (T)
inferred← citeshttps://doi.org/10.1109/aspdac.2005.1466206openalex-snapshot
Sequential equivalence checking using cuts
inferred← citeshttps://doi.org/10.1109/aspdac.2009.4796552openalex-snapshot
Complete-k-Distinguishability for retiming and resynthesis equivalence checking without restricting synthesis
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/date.2007.364480openalex-snapshot
Boosting the Role of Inductive Invariants in Model Checking
inferred← citeshttps://doi.org/10.1109/date.2009.5090893openalex-snapshot
Sequential logic synthesis using symbolic bi-decomposition
inferred← citeshttps://doi.org/10.1109/date.2009.5090934openalex-snapshot
Speeding up model checking by exploiting explicit and hidden verification constraints
inferred← citeshttps://doi.org/10.1109/etfa.2015.7301603openalex-snapshot
Proving equivalence between control software variants for Programmable Logic Controllers
inferred← citeshttps://doi.org/10.1109/fmcad.2008.ecp.6openalex-snapshot
Invariant-Strengthened Elimination of Dependent State Elements
inferred← citeshttps://doi.org/10.1109/fmcad.2008.ecp.8openalex-snapshot
Recording Synthesis History for Sequential Verification
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351146openalex-snapshot
Enhanced verification by temporal decomposition
inferred← citeshttps://doi.org/10.1109/fmcad.2013.6679391openalex-snapshot
A circuit approach to LTL model checking
inferred← citeshttps://doi.org/10.1109/hldvt.2004.1431221openalex-snapshot
Reference model based RTL verification: an integrated approach
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.2006.319987openalex-snapshot
IChecker: An Efficient Checker for Inductive Invariants
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/icasic.2007.4415843openalex-snapshot
An efficient sequential equivalence checking framework using Boolean Satisfiability
inferred← citeshttps://doi.org/10.1109/iccad.2004.1382542openalex-snapshot
Dynamic transition relation simplification for bounded property checking
inferred← citeshttps://doi.org/10.1109/iccad.2006.320087openalex-snapshot
Improvements to Combinational Equivalence Checking
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397285openalex-snapshot
Inductive equivalence checking under retiming and resynthesis
inferred← citeshttps://doi.org/10.1109/iccad.2008.4681580openalex-snapshot
Scalable and scalably-verifiable sequential synthesis
inferred← citeshttps://doi.org/10.1109/iccad66269.2025.11240727openalex-snapshot
Promise: Property Mining for Sequential Synthesis
inferred← citeshttps://doi.org/10.1109/iceas.2011.6147138openalex-snapshot
EQU-IITG: A multi-format formal equivalence checker
inferred← citeshttps://doi.org/10.1109/icse.2012.6227132openalex-snapshot
Automated oracle creation support, or: How I learned to stop worrying about fault propagation and love mutation testing
inferred← citeshttps://doi.org/10.1109/icse.2013.6606556openalex-snapshot
Observable modified condition/decision coverage
inferred← citeshttps://doi.org/10.1109/icst.2015.7102617openalex-snapshot
Test Suite Quality Assessment Using Model Inference Techniques
inferred← citeshttps://doi.org/10.1109/isise.2008.274openalex-snapshot
Verification of Controller Synthesis Based on Completely Specified Finite State Machine
inferred← citeshttps://doi.org/10.1109/mdt.2005.68openalex-snapshot
Principles of Sequential-Equivalence Verification
inferred← citeshttps://doi.org/10.1109/mtv.2005.14openalex-snapshot
Language-driven Validation of Pipelined Processors using Satisfiability Solvers
inferred← citeshttps://doi.org/10.1109/mtv.2008.8openalex-snapshot
Preparing Rearchitected Designs for Sequential Equivalence Checking
inferred← citeshttps://doi.org/10.1109/qce53715.2022.00082openalex-snapshot
Partial Equivalence Checking of Quantum Circuits
inferred← citeshttps://doi.org/10.1109/tcad.2003.811446openalex-snapshot
On the verification of sequential equivalence
inferred← citeshttps://doi.org/10.1109/tcad.2008.2009147openalex-snapshot
Strengthening Model Checking Techniques With Inductive Invariants
inferred← citeshttps://doi.org/10.1109/tcad.2021.3117506openalex-snapshot
Equivalence Checking of Sequential Quantum Circuits
inferred← citeshttps://doi.org/10.1109/test.2008.4700567openalex-snapshot
SAT-based State Justification with Adaptive Mining of Invariants
inferred← citeshttps://doi.org/10.1109/ths.2012.6459818openalex-snapshot
Ensuring trust of third-party hardware design with constrained sequential equivalence checking
inferred← citeshttps://doi.org/10.1109/tpsd.2007.4380384openalex-snapshot
Detecting Malicious Logic Through Structural Checking
inferred← citeshttps://doi.org/10.1109/tse.2015.2421011openalex-snapshot
The Risks of Coverage-Directed Test Case Generation
inferred← citeshttps://doi.org/10.1109/tse.2015.2436920openalex-snapshot
Automated Oracle Data Selection Support
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.1145/1233501.1233679openalex-snapshot
Improvements to combinational equivalence checking
inferred← citeshttps://doi.org/10.1145/1391469.1391506openalex-snapshot
Compositional verification of retiming and sequential optimizations
inferred← citeshttps://doi.org/10.1145/1391469.1391605openalex-snapshot
Merging nodes under sequential observability
inferred← citeshttps://doi.org/10.1145/1629911.1630033openalex-snapshot
Non-cycle-accurate sequential equivalence checking
inferred← citeshttps://doi.org/10.1145/2642937.2642987openalex-snapshot
Automating regression verification
inferred← citeshttps://doi.org/10.1145/2897937.2898004openalex-snapshot
Design partitioning for large-scale equivalence checking and functional correction
inferred← citeshttps://doi.org/10.1145/2934672openalex-snapshot
The Effect of Program and Model Structure on the Effectiveness of MC/DC Test Adequacy Coverage
inferred← citeshttps://doi.org/10.1145/3445814.3446699openalex-snapshot
When application-specific ISA meets FPGAs: a multi-layer virtualization framework for heterogeneous cloud FPGAs
inferred← citeshttps://doi.org/10.1145/3566097.3567843openalex-snapshot
An Equivalence Checking Framework for Agile Hardware Design
inferred← citeshttps://doi.org/10.1145/3610292openalex-snapshot
SoC Protocol Implementation Verification Using Instruction-Level Abstraction Specifications
inferred← citeshttps://doi.org/10.1145/3661308openalex-snapshot
Survey of Machine Learning for Software-assisted Hardware Design Verification: Past, Present, and Prospect
inferred← citeshttps://doi.org/10.1145/3676641.3715993openalex-snapshot
ElasticMiter: Formally Verified Dataflow Circuit Rewrites
inferred← citeshttps://doi.org/10.1145/775832.775948openalex-snapshot
Solving the latch mapping problem in an industrial setting
inferred← citeshttps://doi.org/10.1201/b19714-6openalex-snapshot
Equivalence Checking
inferred← citeshttps://doi.org/10.3233/sat190106openalex-snapshot
Hardware Model Checking Competition 2014: An Analysis and Comparison of Model Checkers and Benchmarks
inferred← citeshttps://doi.org/10.3390/electronics7060081openalex-snapshot
A Survey on Formal Verification Techniques for Safety-Critical Systems-on-Chip
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.204-210.251openalex-snapshot
Sequential Circuit Equivalence Checking Method Based on Minimizing Automation
inferred← citeshttps://doi.org/10.48550/arxiv.1712.09818openalex-snapshot
Automated Formal Equivalence Verification of Pipelined Nested Loops in Datapath Designs
inferred← citeshttps://doi.org/10.5555/1509456.1509516openalex-snapshot
Scalable and scalably-verifiable sequential synthesis
inferred← citeshttps://doi.org/10.5555/1509633.1509780openalex-snapshot
Complete-k-distinguishability for retiming and resynthesis equivalence checking without restricting synthesis
inferred← citeshttps://doi.org/10.5555/1874620.1874970openalex-snapshot
Sequential logic synthesis using symbolic bi-decomposition
inferred← citeshttps://doi.org/10.5555/1874620.1875022openalex-snapshot
Speeding up model checking by exploiting explicit and hidden verification constraints
inferred← citeshttps://doi.org/10.7939/r3fd82openalex-snapshot
A fast circuit similarity-based placement engine for field programmable gate arrays
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.