Performance Analysis of
In this paper, we present a hierarchical flow-sensitive alias analysis algorithm which parameterizes the context-sensitive level. Our approach groups the pointers in a program by their maximum possible dereference levels. It then orders the analysis of each pointer group by its pointer level, starti...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Text |
Language: | English |
Published: |
2006
|
Subjects: | |
Online Access: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.402.3294 http://www.cs.umn.edu/tech_reports_upload/tr1999/99-018.pdf |
id |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.402.3294 |
---|---|
record_format |
openpolar |
spelling |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.402.3294 2023-05-15T18:32:43+02:00 Performance Analysis of Bixia Zheng Pen-chung Yew The Pennsylvania State University CiteSeerX Archives 2006 application/pdf http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.402.3294 http://www.cs.umn.edu/tech_reports_upload/tr1999/99-018.pdf en eng http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.402.3294 http://www.cs.umn.edu/tech_reports_upload/tr1999/99-018.pdf Metadata may be used without restrictions as long as the oai identifier remains attached to it. http://www.cs.umn.edu/tech_reports_upload/tr1999/99-018.pdf interprocedural program analysis alias analysis text 2006 ftciteseerx 2016-01-08T02:52:27Z In this paper, we present a hierarchical flow-sensitive alias analysis algorithm which parameterizes the context-sensitive level. Our approach groups the pointers in a program by their maximum possible dereference levels. It then orders the analysis of each pointer group by its pointer level, starting from the highest level down to the lowest level. During the analysis of each pointer group, a bottom-up traversal of a program call graph is followed by a top-down traversal with the necessary interprocedural information propagated along the way. The interprocedural information is tagged with call-chains, which are the program call graph paths, to achieve context-sensitivity. We also provide empirical results to quantify how different context-sensitive levels affect the precision and the efficiency of the algorithm. Our studies show that (1) the precision improvement achieved by increasing the context-sensitive level of the analysis varies significantly depending on the programs analyzed; (2) increasing the maximum call-chain length for a higher degree of context sensitivity may trigger the exponential complexity problem [15, 10, 23]. Thus, it is very desirable for an algorithm to allow users to select an appropriate context-sensitive level that works best for a particular program. By parameterizing the maximum call-chain length used in tagging the interprocedural information, our approach provides this type of flexibility. Text The Pointers Unknown |
institution |
Open Polar |
collection |
Unknown |
op_collection_id |
ftciteseerx |
language |
English |
topic |
interprocedural program analysis alias analysis |
spellingShingle |
interprocedural program analysis alias analysis Bixia Zheng Pen-chung Yew Performance Analysis of |
topic_facet |
interprocedural program analysis alias analysis |
description |
In this paper, we present a hierarchical flow-sensitive alias analysis algorithm which parameterizes the context-sensitive level. Our approach groups the pointers in a program by their maximum possible dereference levels. It then orders the analysis of each pointer group by its pointer level, starting from the highest level down to the lowest level. During the analysis of each pointer group, a bottom-up traversal of a program call graph is followed by a top-down traversal with the necessary interprocedural information propagated along the way. The interprocedural information is tagged with call-chains, which are the program call graph paths, to achieve context-sensitivity. We also provide empirical results to quantify how different context-sensitive levels affect the precision and the efficiency of the algorithm. Our studies show that (1) the precision improvement achieved by increasing the context-sensitive level of the analysis varies significantly depending on the programs analyzed; (2) increasing the maximum call-chain length for a higher degree of context sensitivity may trigger the exponential complexity problem [15, 10, 23]. Thus, it is very desirable for an algorithm to allow users to select an appropriate context-sensitive level that works best for a particular program. By parameterizing the maximum call-chain length used in tagging the interprocedural information, our approach provides this type of flexibility. |
author2 |
The Pennsylvania State University CiteSeerX Archives |
format |
Text |
author |
Bixia Zheng Pen-chung Yew |
author_facet |
Bixia Zheng Pen-chung Yew |
author_sort |
Bixia Zheng |
title |
Performance Analysis of |
title_short |
Performance Analysis of |
title_full |
Performance Analysis of |
title_fullStr |
Performance Analysis of |
title_full_unstemmed |
Performance Analysis of |
title_sort |
performance analysis of |
publishDate |
2006 |
url |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.402.3294 http://www.cs.umn.edu/tech_reports_upload/tr1999/99-018.pdf |
genre |
The Pointers |
genre_facet |
The Pointers |
op_source |
http://www.cs.umn.edu/tech_reports_upload/tr1999/99-018.pdf |
op_relation |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.402.3294 http://www.cs.umn.edu/tech_reports_upload/tr1999/99-018.pdf |
op_rights |
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
_version_ |
1766216898128642048 |