On the public citation graph
Solver technology for system-level to RTL equivalence checking
0 signed · 49 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.1007/11499107_5openalex-snapshot
Effective Preprocessing in SAT Through Variable and Clause Elimination
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_49openalex-snapshot
CVC Lite: A New Implementation of the Cooperating Validity Checker
inferredcites →https://doi.org/10.1007/978-3-540-72788-0_28openalex-snapshot
A Lightweight Component Caching Scheme for Satisfiability Solvers
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_52openalex-snapshot
A Decision Procedure for Bit-Vectors and Arrays
inferredcites →https://doi.org/10.1007/s10766-005-8910-3openalex-snapshot
Constructing Efficient Formal Models from High-Level Descriptions Using Symbolic Simulation
inferredcites →https://doi.org/10.1109/iccad.1996.569607openalex-snapshot
GRASP-A new search algorithm for satisfiability
inferredcites →https://doi.org/10.1109/iccad.2005.1560201openalex-snapshot
Embedded tutorial: formal equivalence checking between system-level models and RTL
inferredcites →https://doi.org/10.1145/1217856.1217859openalex-snapshot
Solving SAT and SAT Modulo Theories
inferredcites →https://doi.org/10.1145/1233501.1233663openalex-snapshot
Automatic memory reductions for RTL model verification
inferredcites →https://doi.org/10.1145/1278480.1278530openalex-snapshot
Memory modeling in ESL-RTL equivalence checking
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-032-32519-8_20openalex-snapshot
A Multi-width Parametric Bitvector Equivalence Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-27340-2_75openalex-snapshot
Microprocessor Hazard Analysis Via Formal Verification of Parameterized Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-48989-6_33openalex-snapshot
Equivalence Checking of a Floating-Point Unit Against a High-Level C Model
inferred← citeshttps://doi.org/10.1007/978-3-319-52234-0_8openalex-snapshot
Matching Multiplications in Bit-Vector Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-53856-8_58openalex-snapshot
An Abstraction of Multi-port Memories with Arbitrary Addressable Units
inferred← citeshttps://doi.org/10.1007/978-981-10-4121-1_8openalex-snapshot
Formal Methods: Techniques, Applications, Thrust Areas and Future Prospects
inferred← citeshttps://doi.org/10.1007/s10009-020-00591-yopenalex-snapshot
Utilizing parametric systems for detection of pipeline hazards
inferred← citeshttps://doi.org/10.1007/s10836-015-5528-2openalex-snapshot
A Unified Sequential Equivalence Checking Methodology to Verify RTL Designs with High-Level Functional and Protocol Specification Models
inferred← citeshttps://doi.org/10.1016/j.micpro.2013.10.002openalex-snapshot
Formal equivalence verification and debugging techniques with auto-correction mechanism for RTL designs
inferred← citeshttps://doi.org/10.1109/arith58626.2023.00018openalex-snapshot
Formal Verification of Floating-Point Division
inferred← citeshttps://doi.org/10.1109/arith61463.2024.00027openalex-snapshot
On the Systematic Creation of Faithfully Rounded Commutative Truncated Booth Multipliers
inferred← citeshttps://doi.org/10.1109/aspdac.2013.6509686openalex-snapshot
Simplification of C-RTL equivalent checking for fused multiply add unit using intermediate models
inferred← citeshttps://doi.org/10.1109/dac56929.2023.10247912openalex-snapshot
SE3: Sequential Equivalence Checking for Non-Cycle-Accurate Design Transformations †
inferred← citeshttps://doi.org/10.1109/dac63849.2025.11133204openalex-snapshot
Simulation-based Parallel Sweeping: A New Perspective on Combinational Equivalence Checking
inferred← citeshttps://doi.org/10.1109/ddecs.2013.6549789openalex-snapshot
Debugging HDL designs based on functional equivalences with high-level specifications
inferred← citeshttps://doi.org/10.1109/ddecs.2015.24openalex-snapshot
Equivalence Checking on System Level Using a Priori Knowledge
inferred← citeshttps://doi.org/10.1109/fdl.2016.7880367openalex-snapshot
Equivalence checking on ESL utilizing a priori knowledge
inferred← citeshttps://doi.org/10.1109/iccd.2015.7357080openalex-snapshot
Power-aware multi-voltage custom memory models for enhancing RTL and low power verification
inferred← citeshttps://doi.org/10.1109/icces51350.2021.9489148openalex-snapshot
Property Driven Design based Verification for Register Transfer Level Hardware
inferred← citeshttps://doi.org/10.1109/idt.2013.6727074openalex-snapshot
Functional verification of complete sequential behaviors: A formal treatment of discrepancies between system-level and RTL descriptions
inferred← citeshttps://doi.org/10.1109/iscas.2015.7169020openalex-snapshot
Verification of arithmetic datapath designs using word-level approach — A case study
inferred← citeshttps://doi.org/10.1109/isvlsi.2015.110openalex-snapshot
Equivalence Checking Using Trace Partitioning
inferred← citeshttps://doi.org/10.1109/latw.2013.6562666openalex-snapshot
Formal equivalence checking between high-level and RTL hardware designs
inferred← citeshttps://doi.org/10.1109/latw.2014.6841905openalex-snapshot
A unified sequential equivalence checking approach to verify high-level functionality and protocol specification implementations in RTL designs
inferred← citeshttps://doi.org/10.1109/memcod.2015.7340466openalex-snapshot
C-to-Verilog translation validation
inferred← citeshttps://doi.org/10.1109/mtv.2014.21openalex-snapshot
Using Formal Verification of Parameterized Systems in RAW Hazard Analysis in Microprocessors
inferred← citeshttps://doi.org/10.1109/tc.2014.2329687openalex-snapshot
A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs
inferred← citeshttps://doi.org/10.1109/tcad.2011.2110592openalex-snapshot
High-Level Synthesis for FPGAs: From Prototyping to Deployment
inferred← citeshttps://doi.org/10.1109/tcad.2013.2285276openalex-snapshot
Path Predicate Abstraction for Sound System-Level Models of RT-Level Circuit Designs
inferred← citeshttps://doi.org/10.1109/tcad.2019.2921319openalex-snapshot
Properties First—Correct-By-Construction RTL Design in System-Level Design Flows
inferred← citeshttps://doi.org/10.1109/tcad.2024.3410154openalex-snapshot
ROVER: RTL Optimization via Verified E-Graph Rewriting
inferred← citeshttps://doi.org/10.1109/tcad.2026.3661840openalex-snapshot
Simulation-Based Combinational Equivalence Checking With Multiple GPUs
inferred← citeshttps://doi.org/10.1145/1670412openalex-snapshot
Proceedings of the 7th International Workshop on Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.11606/t.3.2014.tde-23122014-155143openalex-snapshot
Checagem de equivalência de sequências de estados de projetos digitais em RTL com modelos de referência em alto nível e de protocolo de comunicação.
inferred← citeshttps://doi.org/10.15760/etd.1041openalex-snapshot
Developing a Strategic Policy Choice Framework for Technological Innovation: Case of Chinese Pharmaceuticals
inferred← citeshttps://doi.org/10.15760/etd.1066openalex-snapshot
Equivalence Checking for High-Assurance Behavioral Synthesis
inferred← citeshttps://doi.org/10.15760/etd.2459openalex-snapshot
Scalable Equivalence Checking for Behavioral Synthesis
inferred← citeshttps://doi.org/10.4204/eptcs.233.9openalex-snapshot
HADES: Microprocessor Hazard Analysis via Formal Verification of Parameterized Systems
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.