Robustness verification of semantic segmentation neural networks using relaxed reachability
From MaRDI portal
(Redirected from Publication:832180)
Recommendations
- Robustness verification of ReLU networks via quadratic programming
- Enhancing robustness verification for deep neural networks via symbolic propagation
- \textsc{OccRob}: efficient SMT-based occlusion robustness verification of deep neural networks
- Advances in verification of ReLU neural networks
- Property-directed verification and robustness certification of recurrent neural networks
- Boosting robustness verification of semantic feature neighborhoods
Cites work
- A game-based approximate verification of deep neural networks with provable guarantees
- Computer vision. Algorithms and applications
- DeepSafe: a data-driven approach for assessing robustness of neural networks
- Formal specification for deep neural networks
- Formal verification of piece-wise linear feed-forward neural networks
- Improved geometric path enumeration for verifying ReLU neural networks
- Reluplex: an efficient SMT solver for verifying deep neural networks
- Safety Verification and Robustness Analysis of Neural Networks via Quadratic Constraints and Semidefinite Programming
- Safety verification of deep neural networks
- Verification of deep convolutional neural networks using ImageStars
- Verisig
Cited in
(11)- Verification of piecewise deep neural networks: a star set approach with zonotope pre-filter
- Verification of deep convolutional neural networks using ImageStars
- Boosting robustness verification of semantic feature neighborhoods
- The octatope abstract domain for verification of neural networks
- Quantitative Verification for Neural Networks using ProbStars
- Verification of Recurrent Neural Networks with Star Reachability
- \textsc{OccRob}: efficient SMT-based occlusion robustness verification of deep neural networks
- The hexatope and octatope abstract domains for neural network verification
- Quantitative verification of learning-enabled systems using ProbStar reachability
- ProbStar temporal logic for verifying complex behaviors of learning-enabled systems
- Reachability analysis of recurrent neural networks
This page was built for publication: Robustness verification of semantic segmentation neural networks using relaxed reachability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832180)
