arXiv CS
open access
SAT Sampling at Scale via GPU-based Boolean Constraint Propagation
Constrained-random verification tests hardware designs by sampling solutions of Boolean formulas. Existing samplers largely follow one of two approaches: CPU-based SAT samplers (e.g., CMSGen), which remain effective even at rare targets but offer limited throughput, and GPU-based gradient samplers,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- SAT Sampling at Scale via GPU-based Boolean Constraint Propagation#1413046
- Equivalence Checking of ML GPU Kernels#612878
- Equivalence Checking of ML GPU Kernels#611401
- Proving LLM-Generated GPU Kernels Correct and Safe: Floating-Point Verification in Lean and VerCors#1389494
- Accelerating Floating-Point Satisfiability Solving via Gradient Normalization#1232847
Record · ID 1406433
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive