CLAD: Constrained Abstract Domain for Neural Network Verification

arXiv:2609.34628 · cs.SE, cs.LG · Submitted 2026-09-28 · Read on arXiv

cs.SE, cs.LG

Submitted: 2026-09-28

Updated: 2026-10-06

Terminology

• Verification — 1× in this paper · explained in 2 episodes

Sources

• FGGM: Formal Grey-box Gradient Method for Attacking DRL-based MU-MIMO Scheduler
• Verifying DNN-based Semantic Communication Against Generative Adversarial Noise
• Scalable Neural Network Verification with Branch-and-bound Inferred Cutting Planes
• The 6th International Verification of Neural Networks Competition (VNN-COMP 2025): Summary and Results
• Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers
• The Fifth International Verification of Neural Networks Competition (VNN-COMP 2024): Summary and Results
• A DPLL(T) Framework for Verifying Deep Neural Networks
• Complete Verification via Multi-Neuron Relaxation Guided Branch-and-Bound
• Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition

Related papers

• Falsification-Based Verification of LLM-Generated Optimization Models: Sound Test Batteries and Their Detection Limits
• GitSkills: A Dataset of Agent Skills on GitHub
• SABER: Benchmarking Operational Safety of LLM Coding Agents in Stateful Project Workspaces
• PackMonitor: Enabling Zero Package Hallucinations Through Decoding-Time Monitoring
• IntentCoding: Amplifying User Intent in Code Generation
• Incentives and Outcomes in Bug Bounties