Widening with thresholds via binary search

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 103
  • Download : 0
In this paper, we present a useful technique for implementing practical static program analyzers that use widening. Our technique aims to improve the efficiency of the conventional widening-with-thresholds technique at a small precision compromise. In static analysis, widening is used to accelerate (or converge) fixed point iterations. Unfortunately, this acceleration often comes with a significant loss in analysis precision. A standard method to improve the precision is to apply the widening with a set of thresholds. However, this technique may significantly slow down the analysis, because in practice it is commonplace to use a large set of thresholds. In worst case, the technique increases the analysis cost by the size N of the threshold set. In this paper, we propose a technique to reduce the worst case by logN, by employing a binary search in the process of applying threshold values. We formalize the technique in the abstract interpretation framework and show that, by experiments with a realistic static analyzer for C, our technique considerably improves the efficiency (by 81.5%) of the existing method with a small compromise (20.9%) on the analysis precision. Copyright (c) 2015 John Wiley & Sons, Ltd.
Publisher
WILEY
Issue Date
2016-10
Language
English
Article Type
Article
Citation

SOFTWARE-PRACTICE & EXPERIENCE, v.46, no.10, pp.1317 - 1328

ISSN
0038-0644
DOI
10.1002/spe.2381
URI
http://hdl.handle.net/10203/271735
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0