Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools
Abstract elided by the publisher.
Related papers
- Using Bounded Model Checking to Focus Fixpoint Iterations SAS 2011
- Fast Numerical Program Analysis with Reinforcement Learning CAV 2018
- Evaluating Design Tradeoffs in Numeric Static Analysis for Java ESOP 2018
- Solving systems of rational equations through strategy iteration TOPLAS 2011
- Fast polyhedra abstract domain POPL 2017
- Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints TACAS 2009
- A practical construction for decomposing numerical abstract domains POPL 2018
- Space-Time Interpolants CAV 2018