Résumé
We introduce a new domain for finding precise numerical invariants of programs by abstract interpretation. This domain, which consists of level sets of non-linear functions, generalizes the domain of linear "templates" introduced by Manna, Sankaranarayanan, and Sipma. In the case of quadratic templates, we use Shor's semi-definite relaxation to derive computable yet precise abstractions of semantic functionals, and we show that the abstract fixpoint equation can be solved accurately by coupling policy iteration and semi-definite programming. We demonstrate the interest of our approach on a series of examples (filters, integration schemes) including a degenerate one (symplectic scheme).
| langue originale | Anglais |
|---|---|
| journal | Logical Methods in Computer Science |
| Volume | 8 |
| Numéro de publication | 1 |
| Les DOIs | |
| état | Publié - 1 janv. 2012 |
Empreinte digitale
Examiner les sujets de recherche de « Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis ». Ensemble, ils forment une empreinte digitale unique.Contient cette citation
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver