Under-Approximating Backward Reachable Sets by Polytopes
Abstract elided by the publisher.
Related papers
- Finding Recurrent Sets with Backward Analysis and Trace Partitioning TACAS 2016
- Provable Preimage Under-Approximation for Neural Networks TACAS 2024
- Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction SAS 2014
- Under-Approximating Cut Sets for Reachability in Large Scale Automata Networks CAV 2013
- Exploiting Adjoints in Property Directed Reachability Analysis CAV 2023
- Revealing Sources of (Memory) Errors via Backward Analysis OOPSLA 2025
- RINO: Robust INner and Outer Approximated Reachability of Neural Networks Controlled Systems CAV 2022
- A Fast and Precise Static Loop Analysis Based on Abstract Interpretation, Program Slicing and Polytope Models CGO 2009