No article text was recorded for this version.
conservative over-approximation
Version 1 of 144 papers46 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Sampling-based Reachability Analysis: A Random Set Theory Approach with Adversarial Sampling
- Blog: Traffic-Rule-Compliant Trajectory Repair via Satisfiability Modulo Theories and Reachability Analysis
- Blog: Computing reachable sets of hybrid systems using a combination of zonotopes and polytopes
- Blog: Finite Horizon Backward Reachability Analysis and Control Synthesis for Uncertain Nonlinear Systems
- Blog: Controller Synthesis with Inductive Proofs for Piecewise Linear Systems: an SMT-based Algorithm
- Blog: Efficient LTL Model Checking of Deep Reinforcement Learning Systems using Policy Extraction
- Blog: Verification-guided Programmatic Controller Synthesis
- Blog: Data-driven verification and synthesis of stochastic systems via barrier certificates
- Blog: Efficient Global Robustness Certification of Neural Networks via Interleaving Twin-Network Encoding
- Blog: Learning Density Distribution of Reachable States for Autonomous Systems
- Blog: Benchmarks for the Formal Verification of Power Systems
- Blog: Safety Guarantees for Neural Network Dynamic Systems via Stochastic Barrier Functions
- Blog: Efficient Global Robustness Certification of Neural Networks via Interleaving Twin-Network Encoding (Extended Abstract)
- Blog: Constrained polynomial zonotopes
- Blog: Scalable Surrogate Verification of Image-Based Neural Network Control Systems Using Composition and Unrolling
- Blog: Exact Characterization of the Convex Hulls of Reachable Sets
- Blog: Data-Driven Hamiltonian for Direct Construction of Safe Set from Trajectory Data
- Blog: Scaling Data-Driven Probabilistic Robustness Analysis for Semantic Segmentation Neural Networks
- Blog: Robustness Verification of Deep Reinforcement Learning Based Control Systems Using Reward Martingales
- Blog: A Classification-based Approach for Approximate Reachability
- Blog: Compositional abstraction-based synthesis of general MDPs via approximate probabilistic relations
- Blog: Data-Driven Reachability with Scenario Optimization and the Holdout Method
- Blog: TIE: Time-Informed Exploration for Robot Motion Planning
- Blog: Decomposition of Reachable Sets and Tubes for a Class of Nonlinear Systems
- Blog: Neural Continuous-Time Supermartingale Certificates
- Blog: Safety Barrier Certificates for Stochastic Hybrid Systems
- Blog: Risk Assessment for Connected Vehicles Under Stealthy Attacks on Vehicle-to-Vehicle Networks
- Blog: Reachability Analysis of a General Class of Neural Ordinary Differential Equations
- Blog: Neural Vector Lyapunov–Razumikhin Certificates for Delayed Interconnected Systems
- Blog: Property-based Polynomial Invariant Generation using Sums-of-Squares Optimization
- Blog: On-The-Fly Control of Unknown Smooth Systems from Limited Data
- Blog: Provably Safe Reinforcement Learning via Action Projection using Reachability Analysis and Polynomial Zonotopes
- Blog: Compositional Analysis for Concurrent Constraint Programming
- Blog: Utilizing dependencies to obtain subsets of reachable sets
- Blog: SMLE: Safe Machine Learning via Embedded Overapproximation
- Blog: Ontology Reuse: Better Safe than Sorry
- Blog: System-Level Safety Monitoring and Recovery for Perception Failures in Autonomous Vehicles
- Blog: Shielded Deep Reinforcement Learning for Complex Spacecraft Tasking
- Blog: Refining Obstacle Perception Safety Zones via Maneuver-Based Decomposition
- Blog: Precise and Generalized Robustness Certification for Neural Networks
- Blog: A contract negotiation scheme for safety verification of interconnected systems
- Blog: Certifying Robustness to Programmable Data Bias in Decision Trees
- Blog: Enhanced Importance Sampling Through Latent Space Exploration in Normalizing Flows
- Blog: Improved Non-Deterministic Planning by Exploiting State Relevance
History & citation
Current · Permanent link
- This direction split from Bridging the Conservatism Gap in Neural Safety Verification (68% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_conservative_over_approximation_7c72aa02,
title = {conservative over-approximation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/conservative-over-approximation/rdr_7c72aa02fe95410c99b7ed96a4d905a6},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_conservative_over_approximation_7c72aa02_v1,
title = {conservative over-approximation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/conservative-over-approximation/rdr_7c72aa02fe95410c99b7ed96a4d905a6/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}