Shooting from the Heap: Ultra-Scalable Static Analysis with Heap Snapshots
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.
Tue 17 Jul Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
11:00 - 12:30: Static AnalysisISSTA Technical Papers at Zurich II Chair(s): Karim AliUniversity of Alberta | |||
11:00 - 11:20 Talk | Repositioning of Static Analysis Alarms ISSTA Technical Papers Tukaram MuskeTata Consultancy Services Ltd, Rohith TalluriTata Consultancy Services Ltd, Alexander SerebrenikEindhoven University of Technology | ||
11:20 - 11:40 Talk | Shooting from the Heap: Ultra-Scalable Static Analysis with Heap Snapshots ISSTA Technical Papers Neville GrechUniversity of Athens, George FourtounisUniversity of Athens, Adrian FrancalanzaUniversity of Malta, Yannis SmaragdakisUniversity of Athens | ||
11:40 - 12:00 Talk | Static Analysis of Java Dynamic Proxies ISSTA Technical Papers George FourtounisUniversity of Athens, George KastrinisUniversity of Athens, Yannis SmaragdakisUniversity of Athens | ||
12:00 - 12:20 Talk | Practical Detection of Concurrency Issues at Coding Time ISSTA Technical Papers Luc BläserHochschule für Technik Rapperswil | ||
12:20 - 12:30 | Q&A in groups ISSTA Technical Papers |