We propose a novel fine-grained integration of pointer analysis with
dynamic analysis, including dynamic symbolic execution. This is
achieved via past-sensitive pointer analysis, an on-demand
pointer analysis instantiated with an abstraction of the dynamic
state on which it is invoked.
We evaluate our technique in three application scenarios: chopped
symbolic execution, symbolic pointer resolution, and
write integrity testing.
Our preliminary results show that the approach can have a significant
impact in these scenarios, by effectively improving the precision of
standard pointer analysis with only a modest performance overhead.
Thu 12 NovDisplayed time zone: (UTC) Coordinated Universal Time change
08:30 - 09:00
|Domain-Independent Interprocedural Program Analysis using Block-Abstraction Memoization|
Research PapersDOI Pre-print Media Attached
|Inherent Vacuity for GR(1) Specifications|
|Interval Counterexamples for Loop Invariant Learning|
|Modular Collaborative Program Analysis in OPAL|
Dominik Helm TU Darmstadt, Germany, Florian Kübler TU Darmstadt, Germany, Michael Reif TU Darmstadt, Germany, Michael Eichberg TU Darmstadt, Germany, Mira Mezini TU Darmstadt, GermanyDOI
|Past-Sensitive Pointer Analysis for Symbolic Execution|
David Trabish Tel Aviv University, Israel, Timotej Kapus Imperial College London, UK, Noam Rinetzky Tel Aviv University, Cristian Cadar Imperial College London, UKDOI Pre-print Media Attached
|Conversations on Analysis 4|