Verifying Recurrent Neural Networks Using Invariant Inference
From MaRDI portal
Recommendations
- Reluplex: a calculus for reasoning about deep neural networks
- Property-directed verification and robustness certification of recurrent neural networks
- Reluplex: an efficient SMT solver for verifying deep neural networks
- Scalable polyhedral verification of recurrent neural networks
- Formal verification of piece-wise linear feed-forward neural networks
Cited in
(14)- Property-directed verification and robustness certification of recurrent neural networks
- Systematic generation of diverse benchmarks for DNN verification
- scientific article; zbMATH DE number 1728659 (Why is no real title available?)
- Computing invariants with transformers: experimental scalability and accuracy
- Reluplex: a calculus for reasoning about deep neural networks
- A survey of model learning techniques for recurrent neural networks
- Probabilistic Verification of Neural Networks Against Group Fairness
- Verifying generalization in deep learning
- Modelling and verifying robotic software that uses neural networks
- Verifying the generalization of deep learning to out-of-distribution domains
- ProbStar temporal logic for verifying complex behaviors of learning-enabled systems
- Reachability analysis of recurrent neural networks
- Tighter abstract queries in neural network verification
- Scalable polyhedral verification of recurrent neural networks
This page was built for publication: Verifying Recurrent Neural Networks Using Invariant Inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6485856)
