Reachability analysis of recurrent neural networks
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
- ProbStar temporal logic for verifying complex behaviors of learning-enabled systems
- Quantitative Verification for Neural Networks using ProbStars
- Reachability analysis of deep ReLU neural networks using facet-vertex incidence
- 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
- Simulation-equivalent reachability of large linear systems with inputs
- Star-based reachability analysis of deep neural networks
- Verification of deep convolutional neural networks using ImageStars
- Verification of piecewise deep neural networks: a star set approach with zonotope pre-filter
- Verification of Recurrent Neural Networks with Star Reachability
- Verifying Recurrent Neural Networks Using Invariant Inference
This page was built for publication: Reachability analysis of recurrent neural networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7015095)
