Pages that link to "Item:Q6108442"
From MaRDI portal
The following pages link to Reluplex: a calculus for reasoning about deep neural networks (Q6108442):
Displaying 14 items.
- \textsc{NeVer}: a tool for artificial neural networks verification (Q421446) (← links)
- Scalable polyhedral verification of recurrent neural networks (Q832168) (← links)
- Verification of piecewise deep neural networks: a star set approach with zonotope pre-filter (Q1982635) (← links)
- A survey of safety and trustworthiness of deep neural networks: verification, testing, adversarial attack and defence, and interpretability (Q2026298) (← links)
- Advances in verification of ReLU neural networks (Q2046329) (← links)
- Enhancing robustness verification for deep neural networks via symbolic propagation (Q2050096) (← links)
- Reluplex: an efficient SMT solver for verifying deep neural networks (Q2151238) (← links)
- A game-based approximate verification of deep neural networks with provable guarantees (Q2286751) (← links)
- Reachability is NP-complete even for the simplest neural networks (Q2695495) (← links)
- Reachability in Simple Neural Networks (Q6070612) (← links)
- Verifying Recurrent Neural Networks Using Invariant Inference (Q6485856) (← links)
- SpecRepair: Counter-Example Guided Safety Repair of Deep Neural Networks (Q6487301) (← links)
- Towards formal XAI: formally approximate minimal explanations of neural networks (Q6535352) (← links)
- Verifying generalization in deep learning (Q6535549) (← links)
