On the public citation graph

Using SAT for combinational equivalence checking

0 signed · 108 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/978-1-4757-2572-8openalex-snapshot
Reasoning in Boolean Networks
inferredcites →https://doi.org/10.1109/dac.1995.249984openalex-snapshot
Advanced Verification Techniques Based on Learning
inferredcites →https://doi.org/10.1109/date.1999.761110openalex-snapshot
Combinational equivalence checking using satisfiability and recursive learning
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.580110openalex-snapshot
Verification of large synthesized designs
inferredcites →https://doi.org/10.1109/iccad.1996.569607openalex-snapshot
GRASP-A new search algorithm for satisfiability
inferredcites →https://doi.org/10.1109/iccad.1997.643607openalex-snapshot
A SAT-based implication engine for efficient ATPG, equivalence checking, and optimization of netlists
inferredcites →https://doi.org/10.1109/iccd.1992.276282openalex-snapshot
Sequential circuit design using synthesis and optimization
inferredcites →https://doi.org/10.1109/icvd.1997.568079openalex-snapshot
Formal verification of combinational circuits
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
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/343647.343801openalex-snapshot
On applying incremental satisfiability to delay fault testing
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
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-4020-6488-3_34openalex-snapshot
BerkMin: A Fast and Robust Sat-Solver
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_15openalex-snapshot
Non-clausal Redundancy Properties
inferred← citeshttps://doi.org/10.1007/978-3-032-16855-9_20openalex-snapshot
A Review of Arithmetic Circuit Verification Using Symbolic Computer Algebra
inferred← citeshttps://doi.org/10.1007/978-3-319-72814-8_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-319-72814-8_3openalex-snapshot
A Symbolic Formulation for Models
inferred← citeshttps://doi.org/10.1007/978-3-319-72814-8_8openalex-snapshot
Re-utilizing Verification Results of UML/OCL Models
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_24openalex-snapshot
Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_19openalex-snapshot
Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit
inferred← citeshttps://doi.org/10.1007/978-981-16-7182-1_36openalex-snapshot
Polynomial Formal Verification of Arithmetic Circuits
inferred← citeshttps://doi.org/10.1007/s10009-004-0183-4openalex-snapshot
A survey of recent advances in SAT-based formal verification
inferred← citeshttps://doi.org/10.1007/s10664-025-10729-8openalex-snapshot
Application of AI to formal methods — an analysis of current trends
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.1007/s10703-024-00452-3openalex-snapshot
Divider verification using symbolic computer algebra and delayed don’t care optimization: theory and practical implementation
inferred← citeshttps://doi.org/10.1007/s10703-026-00494-9openalex-snapshot
Symbolic computer algebra for multipliers revisited - demonstrating the significance of order and phase optimization
inferred← citeshttps://doi.org/10.1007/s11390-005-0004-6openalex-snapshot
Formal Verification Techniques Based on Boolean Satisfiability Problem
inferred← citeshttps://doi.org/10.1016/j.vlsi.2011.05.004openalex-snapshot
Towards accelerating irregular EDA applications with GPUs
inferred← citeshttps://doi.org/10.1098/rsta.2023.0390openalex-snapshot
Automated polynomial formal verification using generalized binary decision diagram patterns
inferred← citeshttps://doi.org/10.1109/aspdac.2003.1194999openalex-snapshot
Logic verification based on diagnosis techniques
inferred← citeshttps://doi.org/10.1109/aspdac.2004.1337569openalex-snapshot
Design diagnosis using Boolean satisfiability
inferred← citeshttps://doi.org/10.1109/aspdac.2007.358021openalex-snapshot
Node Mergers in the Presence of Don't Cares
inferred← citeshttps://doi.org/10.1109/aspdac.2016.7428081openalex-snapshot
To Detect, Locate, and Mask Hardware Trojans in digital circuits by reverse engineering and functional ECO
inferred← citeshttps://doi.org/10.1109/aspdac.2016.7428086openalex-snapshot
Netlist reverse engineering for high-level functionality reconstruction
inferred← citeshttps://doi.org/10.1109/ats.2003.1250864openalex-snapshot
Equivalence checking using independent cuts [logic design verification
inferred← citeshttps://doi.org/10.1109/ats.2004.30openalex-snapshot
Circuit-Width Based Heuristic for Boolean Reasoning
inferred← citeshttps://doi.org/10.1109/cec.2012.6256164openalex-snapshot
Two-step evolution of polymorphic circuits for image multi-filtering
inferred← citeshttps://doi.org/10.1109/cec.2012.6256649openalex-snapshot
On area minimization of complex combinational circuits using cartesian genetic programming
inferred← citeshttps://doi.org/10.1109/cec.2014.6900326openalex-snapshot
Cartesian genetic programming as local optimizer of logic networks
inferred← citeshttps://doi.org/10.1109/cit.2010.219openalex-snapshot
GPU Accelerated VLSI Design Verification
inferred← citeshttps://doi.org/10.1109/dac.2006.229206openalex-snapshot
SAT sweeping with local observability don't-cares
inferred← citeshttps://doi.org/10.1109/dac63849.2025.11132604openalex-snapshot
X-SAT: An Efficient Circuit-Based SAT Solver
inferred← citeshttps://doi.org/10.1109/date.2002.998262openalex-snapshot
BerkMin: A fast and robust SAT-solver
inferred← citeshttps://doi.org/10.1109/date.2003.1253718openalex-snapshot
Verification of proofs of unsatisfiability for CNF formulas
inferred← citeshttps://doi.org/10.1109/date.2005.264openalex-snapshot
SAT-Based Complete Don't-Care Computation for Network Optimization
inferred← citeshttps://doi.org/10.1109/date.2009.5090862openalex-snapshot
Defect-aware logic mapping for nanowire-based programmable logic arrays via satisfiability
inferred← citeshttps://doi.org/10.1109/date.2011.5763326openalex-snapshot
A global postsynthesis optimization method for combinational circuits
inferred← citeshttps://doi.org/10.1109/ddecs54261.2022.9770156openalex-snapshot
Towards Polynomial Formal Verification of Complex Arithmetic Circuits
inferred← citeshttps://doi.org/10.1109/dft66274.2025.11257462openalex-snapshot
Special Session Paper: Application of Functional Verification Techniques in Hardware Trust
inferred← citeshttps://doi.org/10.1109/dft66274.2025.11257470openalex-snapshot
Special Session Paper: Formal Verification Techniques and Reliability Methods for RRAM-based Computing-in-Memory
inferred← citeshttps://doi.org/10.1109/dsd64264.2024.00017openalex-snapshot
SAT can Ensure Polynomial Bounds for the Verification of Circuits with Limited Cutwidth
inferred← citeshttps://doi.org/10.1109/fmcad.2016.7886676openalex-snapshot
Equivalence checking using Gröbner bases
inferred← citeshttps://doi.org/10.1109/fmcad11703.2006openalex-snapshot
2006 Formal Methods in Computer Aided Design
inferred← citeshttps://doi.org/10.1109/fmcad16015.2009openalex-snapshot
2009 Formal Methods in Computer-Aided Design
inferred← citeshttps://doi.org/10.1109/fpl.2018.00009openalex-snapshot
A SAT-based Timing Driven Place and Route Flow for Critical Soft IP
inferred← citeshttps://doi.org/10.1109/hldvt.2001.972826openalex-snapshot
An analysis of ATPG and SAT algorithms for formal verification
inferred← citeshttps://doi.org/10.1109/hldvt.2007.4392790openalex-snapshot
Bridging RTL and gate: correlating different levels of abstraction for design debugging
inferred← citeshttps://doi.org/10.1109/hst.2013.6581568openalex-snapshot
WordRev: Finding word-level structures in a sea of bit-level gates
inferred← citeshttps://doi.org/10.1109/icasic.2005.1611475openalex-snapshot
RTL Satisfiability Solving Using an ATPG based Approach
inferred← citeshttps://doi.org/10.1109/iccad.2002.1167583openalex-snapshot
Combinational equivalence checking through function transformation
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.2017.8203808openalex-snapshot
Advanced datapath synthesis using graph isomorphism
inferred← citeshttps://doi.org/10.1109/iccad57390.2023.10323731openalex-snapshot
SATformer: Transformer-Based UNSAT Core Learning
inferred← citeshttps://doi.org/10.1109/iccad57390.2023.10323798openalex-snapshot
DeepGate2: Functionality-Aware Circuit Representation Learning
inferred← citeshttps://doi.org/10.1109/iccad66269.2025.11240752openalex-snapshot
VeriSAT: the Hardware Design of Modern SAT Solver
inferred← citeshttps://doi.org/10.1109/iccad66269.2025.11240920openalex-snapshot
Revisit Choice Network for Synthesis and Technology Mapping
inferred← citeshttps://doi.org/10.1109/icccas.2008.4657976openalex-snapshot
Constraints partitioning for RTL Satis ability solving by YICES
inferred← citeshttps://doi.org/10.1109/iccd.2010.5647645openalex-snapshot
EQUIPE: Parallel equivalence checking with GP-GPUs
inferred← citeshttps://doi.org/10.1109/iccd56317.2022.00101openalex-snapshot
Equivalence Checking for Flow-Based Computing
inferred← citeshttps://doi.org/10.1109/iccisci.2012.6297244openalex-snapshot
Combinational equivalence checking on the OpenAccess Platform: Performance analysis and research opportunities
inferred← citeshttps://doi.org/10.1109/icicse.2009.46openalex-snapshot
Survey on Formal Verification Methods for Digital IC
inferred← citeshttps://doi.org/10.1109/icmss.2010.5576623openalex-snapshot
An Equivalence Checking Method for Circuits with Black Boxes Based on Logic Cone and SAT
inferred← citeshttps://doi.org/10.1109/icvd.2004.1260982openalex-snapshot
Can SAT be used to improve sequential ATPG methods?
inferred← citeshttps://doi.org/10.1109/isdea.2010.317openalex-snapshot
Hierarchical Design Verification and Error Diagnosis Using Boolean Satisfiability
inferred← citeshttps://doi.org/10.1109/iseda59274.2023.10218412openalex-snapshot
MEC: An Open-source Fine-grained Mapping Equivalence Checking Tool for FPGA
inferred← citeshttps://doi.org/10.1109/isqed60706.2024.10528739openalex-snapshot
A Needle in the Haystack: Inspecting Circuit Layout to Identify Hardware Trojans
inferred← citeshttps://doi.org/10.1109/isqed69900.2026.11534684openalex-snapshot
Cutwidth Decomposition on Circuit-AIGs: Taming Verification Complexity of Arithmetic Circuits
inferred← citeshttps://doi.org/10.1109/mec.2013.6885430openalex-snapshot
An equivalence checking algorithm based on cutset match of gate-level circuits
inferred← citeshttps://doi.org/10.1109/mtv.2003.1250264openalex-snapshot
Fault diagnosis and logic debugging using Boolean satisfiability
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/mwscas.2005.1594049openalex-snapshot
Symbolic verification of synthesized RTL using Boolean satisfiability and uninterpreted RTL transformations
inferred← citeshttps://doi.org/10.1109/reconfig.2013.6732286openalex-snapshot
Enhancing productivity with back-end similarity matching of digital circuits for IP reuse
inferred← citeshttps://doi.org/10.1109/tcad.2005.852031openalex-snapshot
Fault diagnosis and logic debugging using Boolean satisfiability
inferred← citeshttps://doi.org/10.1109/tcad.2005.860955openalex-snapshot
Using simulation and satisfiability to compute flexibilities in Boolean networks
inferred← citeshttps://doi.org/10.1109/tcad.2017.2772854openalex-snapshot
Fast Algebraic Rewriting Based on And-Inverter Graphs
inferred← citeshttps://doi.org/10.1109/tcad.2025.3608060openalex-snapshot
CirOPT : Toward Effective Combinational Equivalence Checking via Compiler Optimization
inferred← citeshttps://doi.org/10.1109/tetc.2023.3322299openalex-snapshot
Non-Invasive Reverse Engineering of One-Hot Finite State Machines Using Scan Dump Data
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.917397openalex-snapshot
Novel Probabilistic Combinational Equivalence Checking
inferred← citeshttps://doi.org/10.1109/vlsi-dat.2018.8373231openalex-snapshot
Using range-equivalent circuits for facilitating bounded sequential equivalence checking
inferred← citeshttps://doi.org/10.1109/vlsid2022.2022.00017openalex-snapshot
Equivalence Checking of Non-Binary Combinational Netlists
inferred← citeshttps://doi.org/10.1109/vlsisoc.2006.313212openalex-snapshot
PEACH: A Novel Architecture for Probabilistic Combinational Equivalence Checking
inferred← citeshttps://doi.org/10.1109/vlsisoc.2009.6041334openalex-snapshot
Structural heuristics for SAT-based ATPG
inferred← citeshttps://doi.org/10.1145/2847263.2847342openalex-snapshot
Boolean Satisfiability-Based Routing and Its Application to Xilinx UltraScale Clock Network
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/3623503openalex-snapshot
Proceedings of the 9th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems
inferred← citeshttps://doi.org/10.1145/3623503.3623535openalex-snapshot
Solving Queries for Boolean Fault Tree Logic via Quantified SAT
inferred← citeshttps://doi.org/10.1145/3715325openalex-snapshot
Unveiling Cross-checking Opportunities in Verilog Compilers
inferred← citeshttps://doi.org/10.1145/3731245openalex-snapshot
ILOSSS - Improved Logic Synthesis based on Several Stateful Logic Gates
inferred← citeshttps://doi.org/10.15760/etd.2459openalex-snapshot
Scalable Equivalence Checking for Behavioral Synthesis
inferred← citeshttps://doi.org/10.15827/0236-235x.131.396-403openalex-snapshot
Структуры данных и модификация метода Квайна–МакКласки при минимизации нормальных форм
inferred← citeshttps://doi.org/10.17076/mat1783openalex-snapshot
Boolean satisfiability verification by quantum annealing
inferred← citeshttps://doi.org/10.21105/joss.04591openalex-snapshot
Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.201-203.836openalex-snapshot
Using Logic Synthesis and Circuit Reasoning for Equivalence Checking
inferred← citeshttps://doi.org/10.70675/1d79f521zac2fz4c89zae36z5157e79eec3fopenalex-snapshot
Approaches for analyzing security properties of smart objects
inferred← citeshttps://doi.org/10.7717/peerj-cs.2169openalex-snapshot
Predicting the satisfiability of Boolean formulas by incorporating gated recurrent unit (GRU) in the Transformer framework
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.