On the public citation graph

Automated Debugging of Arithmetic Circuits Using Incremental Gröbner Basis Reduction

0 signed · 53 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-09519-5_52openalex-snapshot
A criterion for detecting unnecessary reductions in the construction of Gröbner-bases
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_45openalex-snapshot
An Algebraic Approach for Proving Data Correctness in Arithmetic Data Paths
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1016/j.micpro.2015.01.007openalex-snapshot
Groebner basis based formal verification of large arithmetic circuits using Gaussian elimination and cone-based polynomial extraction
inferredcites →https://doi.org/10.1109/aspdac.2007.358004openalex-snapshot
Efficient BMC for Multi-Clock Systems with Clocked Specifications
inferredcites →https://doi.org/10.1109/iccad.2001.968617openalex-snapshot
Induction-based gate-level verification of multipliers
inferredcites →https://doi.org/10.1109/iccad.2007.4397272openalex-snapshot
A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test
inferredcites →https://doi.org/10.1109/isvlsi.2015.16openalex-snapshot
Logic Debugging of Arithmetic Circuits
inferredcites →https://doi.org/10.1109/memcod.2006.1695903openalex-snapshot
Automatic decomposition for sequential equivalence checking of system level and RTL descriptions
inferredcites →https://doi.org/10.1109/mtv.2006.1openalex-snapshot
Abstraction and Refinement Techniques in Automated Design Debugging
inferredcites →https://doi.org/10.1109/tcad.2005.852031openalex-snapshot
Fault diagnosis and logic debugging using Boolean satisfiability
inferredcites →https://doi.org/10.1109/tcad.2010.2061370openalex-snapshot
Bounded Model Debugging
inferredcites →https://doi.org/10.1109/tcad.2013.2263036openalex-snapshot
Path-Directed Abstraction and Refinement for SAT-Based Design Debugging
inferredcites →https://doi.org/10.1109/tcad.2014.2299957openalex-snapshot
Efficient Statistical Model Checking of Hardware Circuits With Multiple Failure Regions
inferredcites →https://doi.org/10.1109/vlsi-soc.2012.6379049openalex-snapshot
An efficient method to localize and correct bugs in high-level designs using counterexamples and potential dependence
inferredcites →https://doi.org/10.1109/vlsid.2014.21openalex-snapshot
Formal Verification and Debugging of Array Dividers with Auto-correction Mechanism
inferredcites →https://doi.org/10.1145/217474.217583openalex-snapshot
Verification of arithmetic circuits with binary moment diagrams
inferredcites →https://doi.org/10.1145/2593069.2593096openalex-snapshot
Automatic Verification of Floating Point Units
inferredcites →https://doi.org/10.1145/2593069.2593134openalex-snapshot
Equivalence Verification of Large Galois Field Arithmetic Circuits using Word-Level Abstraction via Gröbner Bases
inferredcites →https://doi.org/10.1145/2744769.2744925openalex-snapshot
Verification of gate-level arithmetic circuits by function extraction
inferredcites →https://doi.org/10.3850/9783981537079_0248openalex-snapshot
Formal Verification of Integer Multipliers by Combining Gröbner Basis with Logic Reduction
inferredcites →https://doi.org/10.3850/9783981537079_0823openalex-snapshot
Automated Test Generation for Debugging Arithmetic Circuits
inferredcites →https://doi.org/10.5555/1326073.1326122openalex-snapshot
A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test
inferredcites →https://doi.org/10.5555/2755753.2757189openalex-snapshot
Formal verification of sequential Galois field arithmetic circuits using algebraic geometry
inferredcites →https://doi.org/10.5555/603095.603133openalex-snapshot
Induction-based gate-level verification of multipliers
inferredcites →https://doi.org/10.7873/date.2015.0158openalex-snapshot
Formal Verification of Sequential Galois Field Arithmetic Circuits Using Algebraic Geometry

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-02807-7_1openalex-snapshot
Security and Trust Verification of IoT SoCs
inferred← citeshttps://doi.org/10.1007/978-3-030-23425-6_5openalex-snapshot
Rectification of Arithmetic Circuits with Craig Interpolants in Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-030-30596-3_2openalex-snapshot
SoC Security Verification Challenges
inferred← citeshttps://doi.org/10.1007/978-3-030-30596-3_4openalex-snapshot
Anomaly Detection Using Symbolic Algebra
inferred← citeshttps://doi.org/10.1007/978-3-030-30596-3_7openalex-snapshot
SoC Security Verification Using Property Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-69131-8_1openalex-snapshot
Trustworthy System-on-Chip Design Using Secure on-Chip Communication Architectures
inferred← citeshttps://doi.org/10.1007/978-3-030-69131-8_10openalex-snapshot
Network-on-Chip Attack Detection using Machine Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-69131-8_11openalex-snapshot
Trojan Aware Network-on-Chip Routing
inferred← citeshttps://doi.org/10.1007/978-3-030-69131-8_12openalex-snapshot
Network-on-Chip Security and Trust Verification
inferred← citeshttps://doi.org/10.1007/978-3-030-69131-8_18openalex-snapshot
The Future of Secure and Trustworthy Network-on-Chip Architectures
inferred← citeshttps://doi.org/10.1007/978-3-030-69131-8_5openalex-snapshot
Trust-Aware Routing in NoC-Based SoCs
inferred← citeshttps://doi.org/10.1007/978-3-030-69131-8_6openalex-snapshot
Lightweight Anonymous Routing for On-chip Interconnects
inferred← citeshttps://doi.org/10.1007/978-3-030-69131-8_8openalex-snapshot
Real-Time Detection and Localization of DoS Attacks
inferred← citeshttps://doi.org/10.1109/ets.2019.8791541openalex-snapshot
Exploring Algebraic Interpolants for Rectification of Finite Field Arithmetic Circuits with Gröbner Bases
inferred← citeshttps://doi.org/10.1109/host55342.2024.10545407openalex-snapshot
DiSPEL: A Framework for SoC Security Policy Synthesis and Distributed Enforcement
inferred← citeshttps://doi.org/10.1109/iccd53106.2021.00039openalex-snapshot
Rectification of Integer Arithmetic Circuits using Computer Algebra Techniques
inferred← citeshttps://doi.org/10.1109/isqed51717.2021.9424286openalex-snapshot
Word-Level Multi-Fix Rectifiability of Finite Field Arithmetic Circuits
inferred← citeshttps://doi.org/10.1109/isqed65160.2025.11014344openalex-snapshot
Assertion-Based Trojan Localization Using Iterative Path Sensitization
inferred← citeshttps://doi.org/10.1109/isvlsi.2018.00071openalex-snapshot
Combining Symbolic Computer Algebra and Boolean Satisfiability for Automatic Debugging and Fixing of Complex Multipliers
inferred← citeshttps://doi.org/10.1109/itc44170.2019.9000170openalex-snapshot
SoC Security Verification using Property Checking
inferred← citeshttps://doi.org/10.1109/tc.2018.2868362openalex-snapshot
Automated Test Generation for Debugging Multiple Bugs in Arithmetic Circuits
inferred← citeshttps://doi.org/10.1109/test.2018.8624854openalex-snapshot
Scalable Hardware Trojan Activation by Interleaving Concrete Simulation and Symbolic Execution
inferred← citeshttps://doi.org/10.1109/vlsi-soc.2018.8644853openalex-snapshot
On the Rectifiability of Arithmetic Circuits using Craig Interpolants in Finite Fields
inferred← citeshttps://doi.org/10.1109/vlsi-soc53125.2021.9606976openalex-snapshot
Algebraic Techniques for Rectification of Finite Field Circuits
inferred← citeshttps://doi.org/10.1109/vlsid2022.2022.00018openalex-snapshot
Dynamic Variable Ordering during Algebraic Backward Rewriting for Formal Verification of Multipliers
inferred← citeshttps://doi.org/10.1145/3655621openalex-snapshot
Incremental Concolic Testing of Register-Transfer Level Designs
inferred← citeshttps://doi.org/10.23919/fmcad.2018.8603018openalex-snapshot
Post-Verification Debugging and Rectification of Finite Field Arithmetic Circuits using Computer Algebra Techniques
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.