Under-Approximating Loops in C Programs for Fast Counterexample Detection
Abstract elided by the publisher.
Related papers
- Automatic Abstraction in SMT-Based Unbounded Software Model Checking CAV 2013
- Searching for Ribbon-Shaped Paths in Fair Transition Systems TACAS 2022
- A Fast and Precise Static Loop Analysis Based on Abstract Interpretation, Program Slicing and Polytope Models CGO 2009
- Under-Approximation for Scalable Bug Detection (Keynote) CPP 2024
- Prediction and trace compression of data access addresses through nested loop recognition CGO 2008
- Efficient Verification of Network Fault Tolerance via Counterexample-Guided Refinement CAV 2019
- Fast Approximations of Quantifier Elimination CAV 2023
- Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction SAS 2014