2007
DOI: 10.1145/1286821.1286829
|View full text |Cite
|
Sign up to set email alerts
|

An improved bound for call strings based interprocedural analysis of bit vector frameworks

Abstract: Interprocedural data flow analysis extends the scope of analysis across procedure boundaries in search of increased optimization opportunities. Call strings based approach is a general approach for performing flow and context sensitive interprocedural analysis. It maintains a history of calls along with the data flow information in the form of call strings, which are sequences of unfinished calls. Recursive programs may need infinite call strings for interprocedural data flow analysis. For bit vector framework… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
7
0

Year Published

2009
2009
2011
2011

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 16 publications
0
7
0
Order By: Relevance
“…In other work on call string based static analysis, Karkare and Khedker [32] propose an approach that bounds the number of occurrences of any call site in a call string instead of bounding the string length. Their empirical results show that this is enough for achieving high precision and can significantly reduce the analysis time.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In other work on call string based static analysis, Karkare and Khedker [32] propose an approach that bounds the number of occurrences of any call site in a call string instead of bounding the string length. Their empirical results show that this is enough for achieving high precision and can significantly reduce the analysis time.…”
Section: Related Workmentioning
confidence: 99%
“…Their empirical results show that this is enough for achieving high precision and can significantly reduce the analysis time. Besides [32], Khedker and Karkare [33] also modify the classical call string method by identifying contexts which need not be explicitly maintained. This reduces the number of calling contexts dramatically without compromising on the precision, generality and simplicity of the method.…”
Section: Related Workmentioning
confidence: 99%
“…Full call-strings approaches [17,9,10] and functional approaches [17] do not suffer from spurious cycles but are limited to restricted classes of data flow analysis problems. The original full call-strings method [17] prescribes the domain to be finite and its improved algorithms [9,10] are also limited to bit-vector problems or finite domains.…”
Section: Related Workmentioning
confidence: 99%
“…The original full call-strings method [17] prescribes the domain to be finite and its improved algorithms [9,10] are also limited to bit-vector problems or finite domains. Khedker et al's algorithm [10] supports infinite domains only for demand-driven analysis.…”
Section: Related Workmentioning
confidence: 99%
“…The occurrence based bound for call strings for bit-vector frameworks [12] is an improvement over the classical length bound [22]. It constructs call strings with any call site occurring at most 3 times instead of all call strings with lengths up to 3K.…”
Section: Related Workmentioning
confidence: 99%