DNN verification, reachability, and the exponential function problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1140675 (Why is no real title available?)
- scientific article; zbMATH DE number 1157649 (Why is no real title available?)
- scientific article; zbMATH DE number 1169378 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- scientific article; zbMATH DE number 3053259 (Why is no real title available?)
- An abstraction-based framework for neural network verification
- Complexity of reachability problems in neural networks
- Computing machinery and intelligence
- DNN verification, reachability, and the exponential function problem
- Data structures with arithmetic constraints: A non-disjoint combination
- Deep learning
- Efficient neural network analysis with sum-of-infeasibilities
- Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
- Model-theoretic methods in combined constraint satisfiability
- Reachability is NP-complete even for the simplest neural networks
- Reaching out towards fully verified autonomous systems
- Run-time optimization for learned controllers through quantitative games
- Safety verification of deep neural networks
- Satisfiability of systems of equations of real analytic functions is quasi-decidable
- Simplification by Cooperating Decision Procedures
- Some undecidable problems involving elementary functions of a real variable
- Unions of non-disjoint theories and combinations of satisfiability procedures
- Verification of deep convolutional neural networks using ImageStars
- Verisig
Cited in
(2)
This page was built for publication: DNN verification, reachability, and the exponential function problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6967321)
