Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/86214| Title: | Shooting from the heap : ultra-scalable static analysis with heap snapshots |
| Authors: | Grech, Neville Fourtounis, George Francalanza, Adrian Smaragdakis, Yannis |
| Keywords: | Software engineering Programming languages (Electronic computers) Computer programs -- Testing Compilers (Computer programs) |
| Issue Date: | 2018 |
| Publisher: | Association for Computing Machinery |
| Citation: | Grech, N., Fourtounis, G., Francalanza, A., & Smaragdakis, Y. (2018). Shooting from the heap : ultra-scalable static analysis with heap snapshots. 27th ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA’18), Amsterdam. 198-208. |
| Abstract: | Traditional whole-program static analysis (e.g., a points-to analysis that models the heap) encounters scalability problems for realistic applications. We propose a ``featherweight'' analysis that combines a dynamic snapshot of the heap with otherwise full static analysis of program behavior. The analysis is extremely scalable, offering speedups of well over 3x, with complexity empirically evaluated to grow linearly relative to the number of reachable methods. The analysis is also an excellent tradeoff of precision and recall (relative to different dynamic executions): while it can never fully capture all program behaviors (i.e., it cannot match the near-perfect recall of a full static analysis) it often approaches it closely while achieving much higher (3.5x) precision. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/86214 |
| Appears in Collections: | Scholarly Works - FacICTCS |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Shooting from the Heap.pdf Restricted Access | 817.25 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.
