Conflict-driven Structural Learning Towards Higher Coverage Rate in ATPG

• URL: http://arxiv.org/abs/2303.02290v1
• Date: Sat, 4 Mar 2023 01:50:08 GMT
• Title: Conflict-driven Structural Learning Towards Higher Coverage Rate in ATPG
• Abstract summary: This paper proposes a conflict-driven structural learning (C) ATPG algorithm. It is shown that compared with the SAT-based ATPG, the proposed CDSL can on average decrease $25.6%$ aborted faults with $94.51%$ less run time.
• Score: 7.750468474116735
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Due to the increasing challenges posed by the relentless rise in the design complexity of integrated circuits, Boolean Satisfiability (SAT) has emerged as a robust alternative to structural APTG techniques. However, the high cost of transforming a circuit testing problem to a Conjunctive Normal Form (CNF) limits the application of SAT in industrial ATPG scenarios, resulting in a loss of test coverage. In Order to address this problem, this paper proposes a conflict-driven structural learning (CDSL) ATPG algorithm firstly, in which the conflict-driven heuristic methods in modern SAT solver are implemented on the logic cone of fault propagation and activation directly. The proposed CDSL algorithm is composed of three parts: (1) According to the implication graph, various conflict constraints have been learned to prune search space. (2) Conflict-driven implication and justification have been applied to increase decision accuracy and solving efficiency. (3) A conflict-based diagnosis method is further proposed in the case of low coverage debug, leading to making the aborted faults testable by relaxing or modifying some constraints on primary inputs. Extensive experimental results on industrial circuits demonstrate the effectiveness and efficiency of the proposed CDSL algorithm. It is shown that compared with the SAT-based ATPG, the proposed CDSL can on average decrease $25.6\%$ aborted faults with $94.51\%$ less run time. With a two-stage computational flow, it has shown that the proposed CDSL can lead to $46.37\%$ less aborted faults than a one-stage structural algorithm, further with the $3.19\%$ improvement on fault coverage. In addition, the conflict diagnosis can lead to $8.89\%$ less aborted faults on average, and $0.271\%$ improvement in fault coverage rate.

Related papers

• Support Discovery With Iteratively Reweighted Least Squares for Fixed-Charge Network Flow [8.021197489470756]
  The fixed-charge network flow problem (FCNFP) couples continuous flow allocation with discrete arc-activation decisions.<n>We propose a scalable continuous-optimization FCNFP based on an iteratively reweighted least-squares framework.
  arXiv  Detail & Related papers  (2026-09-08T18:00:10Z)
• Adaptive Test-Time Compute Allocation for Reasoning LLMs via Constrained Policy Optimization [18.737087162461563]
  Test-time compute scaling has become a powerful lever for improving large language model performance.<n>Yet deploying these techniques under finite inference budgets requires a decision that current systems largely ignore.<n>We formalize this as a constrained optimization problem (maximize expected accuracy subject to an average compute budget) and solve it with a two-stage Solve-then-Learn pipeline.
  arXiv  Detail & Related papers  (2026-04-16T10:39:22Z)
• SeqTG: Scalable Combinatorial Test Generation via Sequential Integer Linear Programming [9.092621106269503]
  Combinator Testing (CT) is essential for detecting interaction-triggered faults, minimal Covering Arrays under complex constraints remains an unresolved NP-hard challenge.<n>Current greedy algorithms are highly greedy but suffer from severe diminishing returns'': they efficiently cover initial interactions but produce bloated, redundant test suites when struggling to pack the final few difficult pairs.<n>We introduce SeqTG, a scalable framework based on Sequential Linear Programming (ILP)<n>We show that SeqTG effectively eradicates latestage bloat, achieving state-of-the-art test suite compactness and strict constraint adherence.
  arXiv  Detail & Related papers  (2026-03-14T14:18:43Z)
• Neuro-Symbolic Financial Reasoning via Deterministic Fact Ledgers and Adversarial Low-Latency Hallucination Detector [2.950245545999729]
  We introduce the Verifiable Numerical Reasoning Agent (VeNRA)<n>VeNRA shifts the RAG paradigm from retrieving probabilistic text to retrieving deterministic variables via a strictly typed Universal Fact Ledger (UFL)<n>We train the Sentinel: a 3-billion SLM trained to forensically audit candidate using a single-token inference budget.
  arXiv  Detail & Related papers  (2026-03-04T22:55:16Z)
• Closing the Approximation Gap of Partial AUC Optimization: A Tale of Two Formulations [121.39938773554523]
  The Area Under the ROC Curve (AUC) is a pivotal evaluation metric in real-world scenarios with both class imbalance and decision constraints.<n>We present two simple instance-wise minimax reformulations to close the approximation gap of PAUC optimization.<n>The resulting algorithms enjoy a linear per-iteration computational complexity w.r.t. the sample size and a convergence rate of $O(-2/3)$ for typical one-way and two-way PAUCs.
  arXiv  Detail & Related papers  (2025-12-01T02:52:33Z)
• Circuit-Aware SAT Solving: Guiding CDCL via Conditional Probabilities [8.18310731992061]
  Circuit Satisfiability (CSAT) plays a pivotal role in Electronic Design Automation.<n>We introduce CASCAD, a novel circuit-aware SAT solving framework.<n>We show that CASCAD reduces solving times by up to 10x compared to state-of-the-art CNF-based approaches.
  arXiv  Detail & Related papers  (2025-08-06T09:16:47Z)
• Probably approximately correct high-dimensional causal effect estimation given a valid adjustment set [17.10548702837952]
  In the absence of randomized experiments, a common approach to estimating causal effects uses textitcovariate adjustment. We provide a misspecification error bound and a constraint-based algorithm that allow us to go beyond $eps$-Markov blankets to even smaller adjustment sets. Our results highlight that one does not need to perfectly recover causal structure in order to ensure accurate estimates of causal effects.
  arXiv  Detail & Related papers  (2024-11-12T19:37:13Z)
• Scalable Similarity-Aware Test Suite Minimization with Reinforcement Learning [6.9290255098776425]
  TripRL is a novel technique to produce a diverse reduced test suite with high test effectiveness. We show that TripRL's runtime scales linearly with the magnitude of the Multi-Criteria Test Suite Minimization problem.
  arXiv  Detail & Related papers  (2024-08-24T08:43:03Z)
• Peeking with PEAK: Sequential, Nonparametric Composite Hypothesis Tests for Means of Multiple Data Streams [38.04922933299814]
  We build upon the testing-by-betting framework and provide a non-asymptotic $alpha$-level test across any stopping time. Our experiments show that PEAK provides up to an 85% reduction in the number of samples before stopping.
  arXiv  Detail & Related papers  (2024-02-09T01:11:34Z)
• Sub-linear Regret in Adaptive Model Predictive Control [56.705978425244496]
  We present STT-MPC (Self-Tuning Tube-based Model Predictive Control), an online oracle that combines the certainty-equivalence principle and polytopic tubes. We analyze the regret of the algorithm, when compared to an algorithm initially aware of the system dynamics.
  arXiv  Detail & Related papers  (2023-10-07T15:07:10Z)
• Global Context Aggregation Network for Lightweight Saliency Detection of Surface Defects [70.48554424894728]
  We develop a Global Context Aggregation Network (GCANet) for lightweight saliency detection of surface defects on the encoder-decoder structure. First, we introduce a novel transformer encoder on the top layer of the lightweight backbone, which captures global context information through a novel Depth-wise Self-Attention (DSA) module. The experimental results on three public defect datasets demonstrate that the proposed network achieves a better trade-off between accuracy and running efficiency compared with other 17 state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-09-22T06:19:11Z)
• One-Shot Online Testing of Deep Neural Networks Based on Distribution Shift Detection [0.6091702876917281]
  We propose a emphone-shot testing approach that can test NNs accelerated on memristive crossbars with only one test vector. Our approach can consistently achieve $100%$ fault coverage across several large topologies.
  arXiv  Detail & Related papers  (2023-05-16T11:06:09Z)
• TransPath: Learning Heuristics For Grid-Based Pathfinding via Transformers [64.88759709443819]
  We suggest learning the instance-dependent proxies that are supposed to notably increase the efficiency of the search. The first proxy we suggest to learn is the correction factor, i.e. the ratio between the instance independent cost-to-go estimate and the perfect one. The second proxy is the path probability, which indicates how likely the grid cell is lying on the shortest path.
  arXiv  Detail & Related papers  (2022-12-22T14:26:11Z)
• Revisiting and Advancing Fast Adversarial Training Through The Lens of Bi-Level Optimization [60.72410937614299]
  We propose a new tractable bi-level optimization problem, design and analyze a new set of algorithms termed Bi-level AT (FAST-BAT) FAST-BAT is capable of defending sign-based projected descent (PGD) attacks without calling any gradient sign method and explicit robust regularization.
  arXiv  Detail & Related papers  (2021-12-23T06:25:36Z)
• LSDAT: Low-Rank and Sparse Decomposition for Decision-based Adversarial Attack [74.5144793386864]
  LSDAT crafts perturbations in the low-dimensional subspace formed by the sparse component of the input sample and that of an adversarial sample. LSD works directly in the image pixel domain to guarantee that non-$ell$ constraints, such as sparsity, are satisfied.
  arXiv  Detail & Related papers  (2021-03-19T13:10:47Z)
• SADet: Learning An Efficient and Accurate Pedestrian Detector [68.66857832440897]
  This paper proposes a series of systematic optimization strategies for the detection pipeline of one-stage detector. It forms a single shot anchor-based detector (SADet) for efficient and accurate pedestrian detection. Though structurally simple, it presents state-of-the-art result and real-time speed of $20$ FPS for VGA-resolution images.
  arXiv  Detail & Related papers  (2020-07-26T12:32:38Z)
• Making Convolutions Resilient via Algorithm-Based Error Detection Techniques [2.696566807900575]
  Convolutional Neural Networks (CNNs) accurately process real-time telemetry. CNNs must execute correctly in the presence of hardware faults. Full duplication provides the needed assurance but incurs a 100% overhead.
  arXiv  Detail & Related papers  (2020-06-08T23:17:57Z)
• TEASER: Fast and Certifiable Point Cloud Registration [30.19476775410544]
  First fast and robust certifiable algorithm for the registration of 3D points in the presence of large amounts of outliers. Second fast and robust certifiable translation, named TEASER++, uses graduated non-componentity to solve a large subproblem.
  arXiv  Detail & Related papers  (2020-01-21T18:56:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.