Verification of Recurrent Neural Networks with Star Reachability
From MaRDI portal
Cites work
- A survey of safety and trustworthiness of deep neural networks: verification, testing, adversarial attack and defence, and interpretability
- Improved geometric path enumeration for verifying ReLU neural networks
- Parsimonious, Simulation Based Verification of Linear Systems
- Reluplex: an efficient SMT solver for verifying deep neural networks
- Robustness verification of semantic segmentation neural networks using relaxed reachability
- Safety Verification and Robustness Analysis of Neural Networks via Quadratic Constraints and Semidefinite Programming
- Scalable polyhedral verification of recurrent neural networks
- Sherlock - A tool for verification of neural network feedback systems
- Simulation-equivalent reachability of large linear systems with inputs
- Verification of deep convolutional neural networks using ImageStars
- Verification of piecewise deep neural networks: a star set approach with zonotope pre-filter
Cited in
(2)
This page was built for publication: Verification of Recurrent Neural Networks with Star Reachability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202081)