Abstract
The uninterpretability of Deep Neural Networks (DNNs) hinders their use in safety-critical applications. Abstract Interpretation-based DNN certifiers provide promising avenues for building trust in DNNs. Unsoundness in the mathematical logic of these certifiers can lead to incorrect results. However, current approaches to ensure their soundness rely on manual, expert-driven proofs that are tedious to develop, limiting the speed of developing new certifiers. Automating the verification process is challenging due to the complexity of verifying certifiers for arbitrary DNN architectures and handling diverse abstract analyses. We introduce ProveSound, a novel verification procedure that automates the soundness verification of DNN certifiers for arbitrary DNN architectures. Our core contribution is the novel concept of a symbolic DNN, using which, ProveSound reduces the soundness property, a universal quantification over arbitrary DNNs, to a tractable symbolic representation, enabling verification with standard SMT solvers. By formalizing the syntax and operational semantics of ConstraintFlow, a DSL for specifying certifiers, ProveSound efficiently verifies both existing and new certifiers, handling arbitrary DNN architectures. Our code is available at https://github.com/uiuc-focal-lab/constraintflow.git
| Original language | English (US) |
|---|---|
| Article number | 144 |
| Journal | Proceedings of the ACM on Programming Languages |
| Volume | 9 |
| Issue number | 1 |
| Early online date | Apr 9 2025 |
| DOIs | |
| State | Published - Apr 9 2025 |
Keywords
- Abstract interpretation
- Language design
- Machine learning
- Program analysis
- Verification
ASJC Scopus subject areas
- Software
- Safety, Risk, Reliability and Quality
Fingerprint
Dive into the research topics of 'Automated Verification of Soundness of DNN Certifiers'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS