TY - GEN
T1 - Abstractions from tests
AU - Naik, Mayur
AU - Yang, Hongseok
AU - Castelnuovo, Ghila
AU - Sagiv, Mooly
PY - 2012
Y1 - 2012
N2 - We present a framework for leveraging dynamic analysis to find good abstractions for static analysis. A static analysis in our framework is parametrised. Our main insight is to directly and efficiently compute from a concrete trace, a necessary condition on the parameter configurations to prove a given query, and thereby prune the space of parameter configurations that the static analysis must consider. We provide constructive algorithms for two instance analyses in our framework: a flow- and context-sensitive thread-escape analysis and a flow- and context-insensitive points-to analysis. We show the efficacy of these analyses, and our approach, on six Java programs comprising two million bytecodes: the thread-escape analysis resolves 80% of queries on average, disproving 28% and proving 52%; the points-to analysis resolves 99% of queries on average, disproving 29% and proving 70%.
AB - We present a framework for leveraging dynamic analysis to find good abstractions for static analysis. A static analysis in our framework is parametrised. Our main insight is to directly and efficiently compute from a concrete trace, a necessary condition on the parameter configurations to prove a given query, and thereby prune the space of parameter configurations that the static analysis must consider. We provide constructive algorithms for two instance analyses in our framework: a flow- and context-sensitive thread-escape analysis and a flow- and context-insensitive points-to analysis. We show the efficacy of these analyses, and our approach, on six Java programs comprising two million bytecodes: the thread-escape analysis resolves 80% of queries on average, disproving 28% and proving 52%; the points-to analysis resolves 99% of queries on average, disproving 29% and proving 70%.
KW - Necessary-condition problem
KW - Parametrised static analysis
KW - Points-to analysis
KW - Testing
KW - Thread-escape analysis
UR - http://www.scopus.com/inward/record.url?scp=84863268380&partnerID=8YFLogxK
U2 - 10.1145/2103656.2103701
DO - 10.1145/2103656.2103701
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84863268380
SN - 9781450310833
T3 - Conference Record of the Annual ACM Symposium on Principles of Programming Languages
SP - 373
EP - 385
BT - POPL'12 - Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
T2 - 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'12
Y2 - 25 January 2012 through 27 January 2012
ER -