Abstract
Being able to analyze programs function by function, or module by module is a key ingredient to scalable static analyses. The main difficulty for modular static analysis is to be able to do so while not losing too much precision. In this paper, we present a new summary-based approach that builds on previous work of the authors, a zonotopic functional abstraction, that is economical both in space and time complexity. This approach has been implemented, and experiments on numerical programs, reported here, show that this approach is very efficient, and that we still obtain precise analyses in realistic cases.
| Original language | English |
|---|---|
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 7460 LNCS |
| DOIs | |
| Publication status | Published - 1 Jan 2012 |
| Externally published | Yes |
| Event | 19th International Static Analysis Symposium, SAS 2012 - Deauville, France Duration: 11 Sept 2012 → 13 Sept 2012 |