ProofWright: Towards Agentic Formal Verification of CUDA
By: Bodhisatwa Chatterjee , Drew Zagieboylo , Sana Damani and more
Potential Business Impact:
Ensures computer code for graphics is correct and safe.
Large Language Models (LLMs) are increasingly used to automatically generate optimized CUDA kernels, substantially improving developer productivity. However, despite rapid generation, these kernels often contain subtle correctness bugs and lack formal safety guarantees. Runtime testing is inherently unreliable - limited input coverage and reward hacking can mask incorrect behavior - while manual formal verification is reliable but cannot scale to match LLM output rates, creating a critical validation bottleneck. We present ProofWright, an agentic verification framework that bridges this gap by integrating automated formal verification with LLM-based code generation. ProofWright provides end-to-end guarantees of memory safety, thread safety, and semantic correctness for LLM-generated CUDA kernels. On KernelBench L1, ProofWright verifies safety properties for 74% of generated kernels, uncovers subtle correctness errors missed by conventional testing, and establishes semantic equivalence for a class of element-wise kernels. With a modest overhead of 3 minutes per kernel, ProofWright demonstrates that scalable, automated formal verification of LLM-generated GPU code is feasible - offering a path toward trustworthy high-performance code generation without sacrificing developer productivity.
Similar Papers
Towards Robust Agentic CUDA Kernel Benchmarking, Verification, and Optimization
Software Engineering
Makes computer programs run much faster.
Equivalence Checking of ML GPU Kernels
Programming Languages
Checks if computer code for AI works right.
Equivalence Checking of ML GPU Kernels
Programming Languages
Checks if computer code for AI works correctly.