On the public citation graph

SAT-Based Verification Methods and Applications in Hardware Verification

0 signed · 125 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/10722167_13openalex-snapshot
Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking
inferredcites →https://doi.org/10.1007/10722167_15openalex-snapshot
Counterexample-Guided Abstraction Refinement
inferredcites →https://doi.org/10.1007/10722167_36openalex-snapshot
Tuning SAT Checkers for Bounded Model Checking
inferredcites →https://doi.org/10.1007/11513988_12openalex-snapshot
Symmetry Reduction in SAT-Based Model Checking
inferredcites →https://doi.org/10.1007/11513988_31openalex-snapshot
F-Soft: Software Verification Platform
inferredcites →https://doi.org/10.1007/11591191_23openalex-snapshot
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
inferredcites →https://doi.org/10.1007/11691372_9openalex-snapshot
SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in a Separation Logic Solver
inferredcites →https://doi.org/10.1007/3-540-36126-x_3openalex-snapshot
Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis
inferredcites →https://doi.org/10.1007/3-540-36384-x_24openalex-snapshot
Efficient Computation of Recurrence Diameters
inferredcites →https://doi.org/10.1007/3-540-36577-x_2openalex-snapshot
Automatic Abstraction without Counterexamples
inferredcites →https://doi.org/10.1007/3-540-40922-x_22openalex-snapshot
SAT-Based Image Computation with Application in Reachability Analysis
inferredcites →https://doi.org/10.1007/3-540-40922-x_23openalex-snapshot
SAT-Based Verification without State Space Traversal
inferredcites →https://doi.org/10.1007/3-540-40922-x_8openalex-snapshot
Checking Safety Properties Using Induction and a SAT-Solver
inferredcites →https://doi.org/10.1007/3-540-44798-9_4openalex-snapshot
Pruning Techniques for the SAT-Based Bounded Model Checking Problem
inferredcites →https://doi.org/10.1007/3-540-45319-9_18openalex-snapshot
Automatic Abstraction of Memories in the Formal Verification of Superscalar Microprocessors
inferredcites →https://doi.org/10.1007/3-540-45653-8_1openalex-snapshot
Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.
inferredcites →https://doi.org/10.1007/3-540-45657-0_12openalex-snapshot
Property Checking via Structural Analysis
inferredcites →https://doi.org/10.1007/3-540-45657-0_18openalex-snapshot
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
inferredcites →https://doi.org/10.1007/3-540-45657-0_19openalex-snapshot
Applying SAT Methods in Unbounded Symbolic Model Checking
inferredcites →https://doi.org/10.1007/3-540-45657-0_2openalex-snapshot
The Quest for Efficient Boolean Satisfiability Solvers
inferredcites →https://doi.org/10.1007/3-540-45657-0_7openalex-snapshot
Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions
inferredcites →https://doi.org/10.1007/3-540-46419-0_28openalex-snapshot
Symbolic Reachability Analysis Based on SAT-Solvers
inferredcites →https://doi.org/10.1007/3-540-48153-2openalex-snapshot
Correct Hardware Design and Verification Methods
inferredcites →https://doi.org/10.1007/3-540-48153-2_5openalex-snapshot
Superscalar Processor Verification Using Efficient Reductions of the Logic of Equality with Uninterpreted Functions to Propositional Logic
inferredcites →https://doi.org/10.1007/3-540-49059-0_14openalex-snapshot
Symbolic Model Checking without BDDs
inferredcites →https://doi.org/10.1007/3-540-58179-0_44openalex-snapshot
Automatic verification of pipelined microprocessor control
inferredcites →https://doi.org/10.1007/3-540-61474-5_93openalex-snapshot
Symbolic model checking
inferredcites →https://doi.org/10.1007/3-540-63104-6_28openalex-snapshot
SATO: An efficient propositional prover
inferredcites →https://doi.org/10.1007/978-1-4615-3190-6openalex-snapshot
Symbolic Model Checking
inferredcites →https://doi.org/10.1007/978-1-4615-3966-7openalex-snapshot
High-Level VLSI Synthesis
inferredcites →https://doi.org/10.1007/978-1-4615-3966-7_6openalex-snapshot
Cyber: High Level Synthesis System from Software into ASIC
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_23openalex-snapshot
Analysis of Recursive Game Graphs Using Data Flow Equations
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_34openalex-snapshot
Efficient Modeling of Embedded Memories in Bounded Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_50openalex-snapshot
CirCUs: A Satisfiability Solver Geared towards Bounded Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_41openalex-snapshot
DiVer: SAT-Based Model Checking Platform for Verifying Large Scale Systems
inferredcites →https://doi.org/10.1007/978-3-540-39724-3_30openalex-snapshot
Efficient Distributed SAT and SAT-Based Distributed Bounded Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_1openalex-snapshot
Interpolation and SAT-Based Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_20openalex-snapshot
Abstraction and BDDs Complement SAT-Based BMC in DiVer
inferredcites →https://doi.org/10.1007/s10009-004-0183-4openalex-snapshot
A survey of recent advances in SAT-based formal verification
inferredcites →https://doi.org/10.1016/0377-2217(90)90290-ropenalex-snapshot
Digital Systems : Testing and Testable Design
inferredcites →https://doi.org/10.1016/0898-1221(95)90267-8openalex-snapshot
Computer-aided verification of coordinating processes: The automata-theoretic approach
inferredcites →https://doi.org/10.1016/b978-081551447-3.50011-xopenalex-snapshot
Electrical Engineering
inferredcites →https://doi.org/10.1016/s1571-0661(05)82542-3openalex-snapshot
Temporal Induction by Incremental SAT Solving
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1109/32.588521openalex-snapshot
The model checker SPIN
inferredcites →https://doi.org/10.1109/43.108614openalex-snapshot
Test pattern generation using Boolean satisfiability
inferredcites →https://doi.org/10.1109/43.275352openalex-snapshot
Symbolic model checking for sequential circuit verification
inferredcites →https://doi.org/10.1109/9780470544389openalex-snapshot
Digital Systems Testing and Testable Design
inferredcites →https://doi.org/10.1109/date.2002.998262openalex-snapshot
BerkMin: A fast and robust SAT-solver
inferredcites →https://doi.org/10.1109/date.2003.1253720openalex-snapshot
Improving SAT-based bounded model checking by means of BDD-based approximate traversals
inferredcites →https://doi.org/10.1109/date.2005.325openalex-snapshot
Verification of Embedded Memory Systems using Efficient Memory Modeling
inferredcites →https://doi.org/10.1109/iccad.1996openalex-snapshot
Proceedings of International Conference on Computer Aided Design
inferredcites →https://doi.org/10.1109/iccad.2003.159706openalex-snapshot
SATORI-a fast sequential SAT engine for circuits
inferredcites →https://doi.org/10.1109/iccad.2004.1382631openalex-snapshot
Efficient SAT-based unbounded symbolic model checking using circuit cofactoring
inferredcites →https://doi.org/10.1109/iccad45719.2019.8942108openalex-snapshot
Proceedings of the 2019 International Conference on Computer-Aided Design (ICCAD)
inferredcites →https://doi.org/10.1109/iccd.2005.77openalex-snapshot
Model checking C programs using F-Soft
inferredcites →https://doi.org/10.1109/icvd.2005.114openalex-snapshot
Lazy constraints and SAT heuristics for proof-based abstraction
inferredcites →https://doi.org/10.1109/tc.1981.1675757openalex-snapshot
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
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.1109/tcad.2002.804386openalex-snapshot
Robust Boolean reasoning for equivalence checking and functional property verification
inferredcites →https://doi.org/10.1145/1065579.1065773openalex-snapshot
Beyond safety
inferredcites →https://doi.org/10.1145/1119772.1119790openalex-snapshot
SAT-based sequential depth computation
inferredcites →https://doi.org/10.1145/266021.266090openalex-snapshot
Equivalence checking using cuts and heaps
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/371282.371364openalex-snapshot
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
inferredcites →https://doi.org/10.1145/378239.378470openalex-snapshot
Circuit-based Boolean Reasoning
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.1145/378239.379018openalex-snapshot
Dynamic detection and removal of inactive clauses in SAT with application in image computation
inferredcites →https://doi.org/10.1145/378239.379019openalex-snapshot
SATIRE
inferredcites →https://doi.org/10.1145/500001.500059openalex-snapshot
Accelerating boolean satisfiability through application specific processing
inferredcites →https://doi.org/10.1145/513918.514105openalex-snapshot
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
inferredcites →https://doi.org/10.1145/514100.514105openalex-snapshot
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
inferredcites →https://doi.org/10.1145/775832.775945openalex-snapshot
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
inferredcites →https://doi.org/10.1145/775832.775947openalex-snapshot
A signal correlation guided ATPG solver and its applications for solving difficult industrial cases
inferredcites →https://doi.org/10.1145/775832.776040openalex-snapshot
Learning from BDDs in SAT-based bounded model checking
inferredcites →https://doi.org/10.1145/775832.776043openalex-snapshot
SAT-based unbounded symbolic model checking
inferredcites →https://doi.org/10.1145/775944.775945openalex-snapshot
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
inferredcites →https://doi.org/10.1145/776038.776040openalex-snapshot
Learning from BDDs in SAT-based bounded model checking
inferredcites →https://doi.org/10.1145/776038.776043openalex-snapshot
SAT-based unbounded symbolic model checking
inferredcites →https://doi.org/10.1201/9781420036336openalex-snapshot
The Industrial Information Technology Handbook
inferredcites →https://doi.org/10.5555/789083.1022835openalex-snapshot
Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications
inferredcites →https://doi.org/10.5555/789083.1022838openalex-snapshot
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals
inferredcites →https://doi.org/10.5555/996070.1009924openalex-snapshot
Iterative Abstraction using SAT-based BMC with Proof Analysis

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-3-030-20323-8_5openalex-snapshot
Improving SAT Solving Using Monte Carlo Tree Search-Based Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-30048-7_8openalex-snapshot
Exploiting Glue Clauses to Design Effective CDCL Branching Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_12openalex-snapshot
On CDCL-Based Proof Systems with the Ordered Decision Strategy
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_18openalex-snapshot
Towards Faster Reasoners by Using Transparent Huge Pages
inferred← citeshttps://doi.org/10.1007/978-3-031-22953-4_8openalex-snapshot
Domain Dependent Parameter Setting in SAT Solver Using Machine Learning Techniques
inferred← citeshttps://doi.org/10.1007/978-3-031-33170-1_27openalex-snapshot
A Linear Weight Transfer Rule for Local Search
inferred← citeshttps://doi.org/10.1007/978-3-031-76554-4_17openalex-snapshot
Improving SAT Solver Performance Through MLP-Predicted Genetic Algorithm Parameters
inferred← citeshttps://doi.org/10.1007/978-3-032-04590-4_14openalex-snapshot
Maximum Satisfiability Formulations for Nonlinear Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-032-26204-2_12openalex-snapshot
SAT-Based Syndrome Decoding and Low-Weight Codewords
inferred← citeshttps://doi.org/10.1007/978-3-032-27368-0_1openalex-snapshot
Polynomial Representation of Rounded Floating-Point Addition Using *PHDDs
inferred← citeshttps://doi.org/10.1007/978-3-032-40421-3_21openalex-snapshot
Satisfiability Modulo Theories-Based Consistency Checking for Highly Variable Cyber-Physical Production Systems
inferred← citeshttps://doi.org/10.1007/s10836-018-5747-4openalex-snapshot
An Efficient SAT-Based Test Generation Algorithm with GPU Accelerator
inferred← citeshttps://doi.org/10.1073/pnas.2517297122openalex-snapshot
Advancing stochastic 3-SAT solvers by dissipating oversatisfied constraints
inferred← citeshttps://doi.org/10.1109/ahs.2013.6604248openalex-snapshot
Formal approaches to SEU testing in FPGAs
inferred← citeshttps://doi.org/10.1109/confluence56041.2023.10048892openalex-snapshot
A Class of Polynomially Verifiable Circuits of Logarithmic Depth
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/dsd67783.2025.00088openalex-snapshot
Automatic Polynomial Formal Verification of a Floating-Point Multiplier
inferred← citeshttps://doi.org/10.1109/iccai66501.2025.00084openalex-snapshot
Kissat_MAB_CoRephase: Combining Different Rephasing Heuristics Using MAB in SAT
inferred← citeshttps://doi.org/10.1109/icdis50059.2020.00024openalex-snapshot
Solving Dynamic 3-SAT Formula: An Empirical Study
inferred← citeshttps://doi.org/10.1109/icstw.2010.17openalex-snapshot
SAT Solvers for Queries over Tree Automata with Constraints
inferred← citeshttps://doi.org/10.1109/isca66397.2026.00165openalex-snapshot
SATIC: An Optimizing Ising Compiler for SAT(isfiability)
inferred← citeshttps://doi.org/10.1109/iscait64916.2025.11010289openalex-snapshot
Reward Defining in Multi-armed Bandit SAT Strategy
inferred← citeshttps://doi.org/10.1109/ismvl60454.2024.00037openalex-snapshot
Polynomial Formal Verification of Multi-Valued Logic Circuits within Constant Cutwidth Architectures
inferred← citeshttps://doi.org/10.1109/tcsi.2025.3531008openalex-snapshot
Polynomial Formal Verification of Multi-Valued Approximate Circuits Within Constant Cutwidth
inferred← citeshttps://doi.org/10.1145/2110147.2110157openalex-snapshot
Managing SAT inconsistencies with HUMUS
inferred← citeshttps://doi.org/10.1145/2362536.2362543openalex-snapshot
A comparison of strategies for tolerating inconsistencies during decision-making
inferred← citeshttps://doi.org/10.1145/3470639openalex-snapshot
Study of Fine-grained Nested Parallelism in CDCL SAT Solvers
inferred← citeshttps://doi.org/10.1145/3625223.3649274openalex-snapshot
Polynomial Formal Verification exploiting Constant Cutwidth
inferred← citeshttps://doi.org/10.1145/3694906.3743355openalex-snapshot
Brief Announcement: A Novel Integrated Parallel Accelerator for an Irregular Killer App
inferred← citeshttps://doi.org/10.11606/d.76.2021.tde-02092021-162034openalex-snapshot
Search strategies and phase transition in the Random Boolean satisfiability problem
inferred← citeshttps://doi.org/10.1504/ijwmc.2021.10045837openalex-snapshot
Community-based 3-SAT formulas with a predefined solution
inferred← citeshttps://doi.org/10.1504/ijwmc.2021.121603openalex-snapshot
Community-based 3-SAT formulas with a predefined solution
inferred← citeshttps://doi.org/10.1609/aaai.v34i02.5500openalex-snapshot
Guiding CDCL SAT Search via Random Exploration amid Conflict Depression
inferred← citeshttps://doi.org/10.1609/socs.v18i1.35997openalex-snapshot
Multi-armed Bandit Algorithms for the Boolean Satisfiability Problem: A Survey
inferred← citeshttps://doi.org/10.29007/cz1fopenalex-snapshot
Decision levels are stable: towards better SAT heuristics
inferred← citeshttps://doi.org/10.3390/math11081888openalex-snapshot
Heuristics for Quantum Computing Dealing with 3-SAT
inferred← citeshttps://doi.org/10.48550/arxiv.2105.04595openalex-snapshot
A Deep Dive into Conflict Generating Decisions
inferred← citeshttps://doi.org/10.5555/2561828.2561875openalex-snapshot
FPGA acceleration of enhanced boolean constraint propagation for SAT solvers
inferred← citeshttps://doi.org/10.70675/932a7c81z8d8dz4199z9e7bz02240dcf3998openalex-snapshot
Reasoning and inference for (maximum) satisfiability : new insights
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.