On the public citation graph

LPSAT: a unified approach to RTL satisfiability

0 signed · 69 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-61474-5_95openalex-snapshot
VIS: A system for verification and synthesis
inferredcites →https://doi.org/10.1007/3-540-63104-6_28openalex-snapshot
SATO: An efficient propositional prover
inferredcites →https://doi.org/10.1016/0305-0548(86)90056-0openalex-snapshot
Some results and experiments in programming techniques for propositional logic
inferredcites →https://doi.org/10.1109/43.536723openalex-snapshot
Combinational test generation using satisfiability
inferredcites →https://doi.org/10.1109/43.644030openalex-snapshot
Explicit and implicit algorithms for binate covering problems
inferredcites →https://doi.org/10.1109/92.386221openalex-snapshot
Generation of design verification tests from behavioral VHDL programs using path enumeration and constraint programming
inferredcites →https://doi.org/10.1109/dac.1990.114826openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1109/date.2000.840044openalex-snapshot
A BDD-based satisfiability infrastructure using the unate recursive paradigm
inferredcites →https://doi.org/10.1109/iccad.1990.129848openalex-snapshot
Minimization of symbolic relations
inferredcites →https://doi.org/10.1109/iccad.1992.279335openalex-snapshot
A new algorithm for the binate covering problem and its application to the minimization of Boolean relations
inferredcites →https://doi.org/10.1109/iccad.1996.569607openalex-snapshot
GRASP-A new search algorithm for satisfiability
inferredcites →https://doi.org/10.1109/iccd.1992.276260openalex-snapshot
Constraint solving for test case generation: a technique for high-level design verification
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/277044.277187openalex-snapshot
Functional vector generation for HDL models using linear programming and 3-satisfiability
inferredcites →https://doi.org/10.1145/307418.307557openalex-snapshot
Algorithms for solving Boolean satisfiability in combinational circuits
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory

What points at this work

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

inferred← citeshttps://doi.org/10.1007/1-4020-2530-0_3openalex-snapshot
Equivalence Checking of Arithmetic Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-59776-8_1openalex-snapshot
Sharpening Constraint Programming Approaches for Bit-Vector Theory
inferred← citeshttps://doi.org/10.1007/s10766-005-8909-9openalex-snapshot
Verification of Embedded Systems Based on Interval Analysis
inferred← citeshttps://doi.org/10.1007/s12532-008-0001-1openalex-snapshot
SCIP: solving constraint integer programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.001openalex-snapshot
Encoding RTL Constructs for MathSAT: a Preliminary Report
inferred← citeshttps://doi.org/10.1016/j.microrel.2009.08.006openalex-snapshot
Using Boolean satisfiability for computing soft error rates in early design stages
inferred← citeshttps://doi.org/10.1016/j.sysarc.2004.10.006openalex-snapshot
Functional test generation based on word-level SAT
inferred← citeshttps://doi.org/10.1016/j.vlsi.2009.06.003openalex-snapshot
Formal verification of high-level data-flow synthesis designs using relational modeling and symbolic computation
inferred← citeshttps://doi.org/10.1049/el.2009.3637openalex-snapshot
Adder model for mixed integer linear programming
inferred← citeshttps://doi.org/10.1049/el:20040304openalex-snapshot
Multiplexer model for RTL satisfiability using MILP
inferred← citeshttps://doi.org/10.1109/aspdac.2002.995022openalex-snapshot
RTL-datapath verification using integer linear programming
inferred← citeshttps://doi.org/10.1109/ats.2007.92openalex-snapshot
EHSAT Modeling from Algorithm Description for RTL Model Checking
inferred← citeshttps://doi.org/10.1109/csse.2008.1352openalex-snapshot
USAT: An Integrated Platform for Satisfiability Solving and Model Checking
inferred← citeshttps://doi.org/10.1109/dac.2005.193852openalex-snapshot
Normalization at the arithmetic bit level
inferred← citeshttps://doi.org/10.1109/date.2004.1268823openalex-snapshot
Arithmetic reasoning in DPLL-based SAT solving
inferred← citeshttps://doi.org/10.1109/date.2005.127openalex-snapshot
Efficient Conflict-Based Learning in an RTL Circuit Constraint Solver
inferred← citeshttps://doi.org/10.1109/delta.2008.12openalex-snapshot
A Novel Approach to High-Level Property Checking Using Wu's Method
inferred← citeshttps://doi.org/10.1109/dft.2008.52openalex-snapshot
Obtaining Microprocessor Vulnerability Factor Using Formal Methods
inferred← citeshttps://doi.org/10.1109/dftvs.2002.1173533openalex-snapshot
Emulation-based design errors identification
inferred← citeshttps://doi.org/10.1109/hldvt.2001.972818openalex-snapshot
Reducing bitvector satisfiability problems to scale down design sizes for RTL property checking
inferred← citeshttps://doi.org/10.1109/hldvt.2003.1252482openalex-snapshot
Functional vector generation for assertion-based verification at behavioral level using interval analysis
inferred← citeshttps://doi.org/10.1109/hldvt.2006.319965openalex-snapshot
Assertion-based Verification of Behavioral Descriptions with Non-linear Solver
inferred← citeshttps://doi.org/10.1109/icasic.2005.1611470openalex-snapshot
RTL Property Checking Technology Based on ATPG and ILP
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.2008.4681562openalex-snapshot
Verification of arithmetic datapaths using polynomial function models and congruence solving
inferred← citeshttps://doi.org/10.1109/icccas.2006.285167openalex-snapshot
RTSAT: A Hybrid Satisfiability Solver for RTL Circuits
inferred← citeshttps://doi.org/10.1109/icccas.2007.4348294openalex-snapshot
Verilog Transformation for an RTL SAT Solver in Formal Verification
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.2003.1240893openalex-snapshot
Test generation for non-separable RTL controller-datapath circuits using a satisfiability based approach
inferred← citeshttps://doi.org/10.1109/iccpct.2015.7159418openalex-snapshot
Comparision between LPSAT and SMT for RTL verification
inferred← citeshttps://doi.org/10.1109/icicse.2009.46openalex-snapshot
Survey on Formal Verification Methods for Digital IC
inferred← citeshttps://doi.org/10.1109/icsict.2008.4735043openalex-snapshot
A symbolic methodology for formal verification of high-level data-flow synthesis
inferred← citeshttps://doi.org/10.1109/iita.2008.519openalex-snapshot
CSP-Based RTL-Datapath Satisfiability Solving: Strategies and Comparisons
inferred← citeshttps://doi.org/10.1109/isqed.2004.1283676openalex-snapshot
Functional vector generation for combinational circuits based on data path coverage metric and mixed integer linear programming
inferred← citeshttps://doi.org/10.1109/isqed.2009.4810306openalex-snapshot
A geometric approach to register transfer level satisfiability
inferred← citeshttps://doi.org/10.1109/mdt.2003.1214351openalex-snapshot
Fault models and test generation for hardware-software covalidation
inferred← citeshttps://doi.org/10.1109/mwscas.2011.6026380openalex-snapshot
A high-level design exploration of heterogeneous adders based on Mixed Integer Linear Programming
inferred← citeshttps://doi.org/10.1109/sp46214.2022.9833782openalex-snapshot
CirC: Compiler infrastructure for proof systems, software verification, and more
inferred← citeshttps://doi.org/10.1109/tc.2006.153openalex-snapshot
Taylor Expansion Diagrams: A Canonical Representation for Verification of Data Flow Designs
inferred← citeshttps://doi.org/10.1109/tcad.2005.853700openalex-snapshot
Satisfiability-based test generation for nonseparable RTL controller-datapath circuits
inferred← citeshttps://doi.org/10.1109/tcad.2007.906458openalex-snapshot
A Normalization Method for Arithmetic Data-Path Verification
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.917424openalex-snapshot
Automatic Constraint Based Test Generation for Behavioral HDL Models
inferred← citeshttps://doi.org/10.1145/1670412openalex-snapshot
Proceedings of the 7th International Workshop on Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1145/3460319.3464826openalex-snapshot
Type and interval aware array constraint solving for symbolic execution
inferred← citeshttps://doi.org/10.2991/jcis.2008.22openalex-snapshot
RTL Test Generation via Fault Insertion and Hybrid Satisfiability Solving
inferred← citeshttps://doi.org/10.3233/sat190034openalex-snapshot
Lazy Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.60797/itech.2026.11.8openalex-snapshot
SAT-генерация тестовых векторов на elaborate-представлении RTL без этапа логического синтеза: экспериментальное обоснование маршрута и перспективы ранней характеризации блоков
inferred← citeshttps://doi.org/10.60797/itech.2026.11.8.1openalex-snapshot
Tool flow: Route A (full synthesis) versus Route B (elaborate only)
inferred← citeshttps://doi.org/10.60797/itech.2026.11.8.2openalex-snapshot
Larrabee miter construction for stuck-at fault detection
inferred← citeshttps://doi.org/10.60797/itech.2026.11.8.3openalex-snapshot
Stuck-at fault coverage
inferred← citeshttps://doi.org/10.60797/itech.2026.11.8.4openalex-snapshot
Wall-clock time
inferred← citeshttps://doi.org/10.60797/itech.2026.11.8.5openalex-snapshot
Cross-validation: detection of one flow's faults by the other flow's vectors
inferred← citeshttps://doi.org/10.60797/itech.2026.11.8.6openalex-snapshot
AIG structure and CNF size
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.