Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
No abstract available.
Related papers
- Space-Time Interpolants CAV 2018
- Efficient Dynamic Error Reduction for Hybrid Systems Reachability Analysis TACAS 2018
- Counterexample-Guided Refinement of Template Polyhedra TACAS 2017
- Static Analysis of ReLU Neural Networks with Tropical Polyhedra SAS 2021
- Efficient Verification of Network Fault Tolerance via Counterexample-Guided Refinement CAV 2019
- Simple and Precise Widenings for H-Polyhedra APLAS 2010
- Precise Widening Operators for Convex Polyhedra SAS 2003
- A practical construction for decomposing numerical abstract domains POPL 2018