Program analysis with local policy iteration
From MaRDI portal
Abstract: We present a new algorithm for deriving numerical invariants that combines the precision of max-policy iteration with the flexibility and scalability of conventional Kleene iterations. It is defined in the Configurable Program Analysis (CPA) framework, thus allowing inter-analysis communication. It uses adjustable-block encoding in order to traverse loop-free program sections, possibly containing branching, without introducing extra abstraction. Our technique operates over any template linear constraint domain, including the interval and octagon domains; templates can also be derived from the program source. The implementation is evaluated on a set of benchmarks from the Software Verification Competition (SV-Comp). It competes favorably with state-of-the-art analyzers.
Recommendations
Cited in
(5)- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
- Integrating Policy Iterations in Abstract Interpreters
- Computer Aided Verification
- Fast numerical program analysis with reinforcement learning
- A change-based heuristic for static analysis with policy iteration
This page was built for publication: Program analysis with local policy iteration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796041)