Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks

Guy Katz, Clark Barrett, David Dill, Kyle Julian, Mykel Kochenderfer
2/3/2017
cs.AIcs.LO

Official code: guykatzz/ReluplexCav2017 (104 stars, last commit 2020-07-08).

Abstract

Deep neural networks have emerged as a widely used and effective means for tackling complex, real-world problems. However, a major obstacle in applying them to safety-critical systems is the great difficulty in providing formal guarantees about their behavior. We present a novel, scalable, and efficient technique for verifying properties of deep neural networks (or providing counter-examples). The technique is based on the simplex method, extended to handle the non-convex Rectified Linear Unit (ReLU) activation function, which is a crucial ingredient in many modern neural networks. The verification procedure tackles neural networks as a whole, without making any simplifying assumptions. We evaluated our technique on a prototype deep neural network implementation of the next-generation airborne collision avoidance system for unmanned aircraft (ACAS Xu). Results show that our technique can successfully prove properties of networks that are an order of magnitude larger than the largest networks verified using existing methods.

View on arXivView PDF

Code Implementations(1)

10450C, C#May 3, 20176 years agoNOASSERTION

Similar Papers

Cite this paper

@article{katz2017reluplex,
  title  = {Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks},
  author = {Guy Katz and Clark Barrett and David Dill and Kyle Julian and Mykel Kochenderfer},
  year   = {2017},
  eprint = {1702.01135},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1702.01135}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1702.01135.svg)](https://codeofpaper.com/paper/1702.01135)

Discussion