|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b30. リサーチレポート >
Research Report - School of Information Science ： ISSN 0918-7553 >
IS-RR-2011 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/9813
|
| タイトル: | Modular Stacking-based Context-Sensitive Program Analysis |
| 著者: | Li, Xin
Ogawa, Mizuhito |
| 発行日: | 2011-06-29 |
| 出版者: | 北陸先端科学技術大学院大学情報科学研究科 |
| 誌名: | Research report (School of Information Science, Japan Advanced Institute of Science and Technology) |
| 巻: | IS-RR-2011-002 |
| 開始ページ: | 1 |
| 終了ページ: | 22 |
| 抄録: | This paper presents a systematic approach to scaling stackingbased context-sensitive program analysis yielded by weighted pushdown systems, and demonstrates its effectiveness by applications to Java pointsto analysis. Our approach relies on the view offormulating stacking-based analysis as AGPs (abstract grammar problem), and reducing the analysis problem to fixed-point calculation over the equation system encoded by grammar productions. To characterize points-to analysis that does notassume an existing program control flow, we propose Contracted AGP, and a symbolic sliding-window based algorithm for it. The algorithm aimsat reducing both time and memory costs, and its correctness is proved in terms of chaotic iteration. Finally, we instantiated the algorithm within Japot, a context-sensitive points-to analyzer for Java. Experiments show two-fold benefits of our approach in practice, with (i) scaling Japot toDacapo benchmark suite, and (ii) a speed-up of 3x faster in average, given an adjustable memory budget. |
| URI: | http://hdl.handle.net/10119/9813 |
| 資料タイプ: | publisher |
| 出現コレクション: | IS-RR-2011
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| IS-RR-2011-002.pdf | | 1975Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
