TL;DR
Demotic introduces a differentiable, GPU-accelerated sampler for CircuitSAT problems that significantly outperforms heuristic methods in runtime, enabling efficient sampling of digital circuit solutions.
Contribution
It presents Demotic, a novel gradient descent-based differentiable sampler for multi-level digital circuits, improving scalability and runtime over existing heuristic approaches.
Findings
Demotic achieves over 100x faster sampling times on ISCAS-85 benchmarks.
It effectively learns valid solutions using gradient descent as a supervised regression task.
The approach enables parallel, GPU-accelerated sampling for complex digital circuits.
Abstract
Efficient sampling of satisfying formulas for circuit satisfiability (CircuitSAT), a well-known NP-complete problem, is essential in modern front-end applications for thorough testing and verification of digital circuits. Generating such samples is a hard computational problem due to the inherent complexity of digital circuits, size of the search space, and resource constraints involved in the process. Addressing these challenges has prompted the development of specialized algorithms that heavily rely on heuristics. However, these heuristic-based approaches frequently encounter scalability issues when tasked with sampling from a larger number of solutions, primarily due to their sequential nature. Different from such heuristic algorithms, we propose a novel differentiable sampler for multi-level digital circuits, called {\sc Demotic}, that utilizes gradient descent (GD) to solve the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
