ProbStar temporal logic for verifying complex behaviors of learning-enabled systems
From MaRDI portal
Cites work
- A mathematical introduction to logic.
- A survey of safety and trustworthiness of deep neural networks: verification, testing, adversarial attack and defence, and interpretability
- Case study
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Formal verification of neural network controlled autonomous systems
- Improved geometric path enumeration for verifying ReLU neural networks
- Quantitative Verification for Neural Networks using ProbStars
- Reachability analysis for neural feedback systems using regressive polynomial rule inference
- 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
- Shared Certificates for Neural Network Verification
- Star-based reachability analysis of deep neural networks
- Verifying Recurrent Neural Networks Using Invariant Inference
- Verifying low-dimensional input neural networks via input quantization
- Verisig
This page was built for publication: ProbStar temporal logic for verifying complex behaviors of learning-enabled systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6904626)
