請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/8580完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 劉邦鋒 | |
| dc.contributor.author | Yu-Hsiu Cheng | en |
| dc.contributor.author | 鄭宇修 | zh_TW |
| dc.date.accessioned | 2021-05-20T19:58:36Z | - |
| dc.date.available | 2012-07-20 | |
| dc.date.available | 2021-05-20T19:58:36Z | - |
| dc.date.copyright | 2010-07-20 | |
| dc.date.issued | 2010 | |
| dc.date.submitted | 2010-07-12 | |
| dc.identifier.citation | Bibliography
[1] M. Naik, A. Aiken, and J. Whaley. Effective static race detection for java. In PLDI ’06: Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation, pages 308–319, New York, NY, USA, 2006. ACM. [2] G. Upadhyaya, S.P. Midkiff, and V.S. Pai. Using data structure knowledge for efficient lock generation and strong atomicity. In Proceedings of the 15th ACM SIGPLAN symposium on Principles and practice of parallel programming, PPoPP ’10, pages 281–292, New York, NY, USA, 2010. ACM. [3] L. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, University of Copenhagen, 1994. [4] B. Steensgaard. Points-to analysis in almost linear time. In Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages, pages 32–41, New York, NY, USA, 1996. ACM. [5] A. Milanova, A. Rountev, and B.G. Ryder. Parameterized object sensitivity for points-to and side-effect analyses for java. In ISSTA ’02: Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis, pages 1–11, New York, NY, USA, 2002. ACM. [6] R. Ghiya, D. Lavery, and D. Sehr. On the importance of points-to analysis and other memory disambiguation methods for c programs. SIGPLAN Not., 36:47–58, May 2001. [7] D.J. Pearce, P.H.J. Kelly, and C. Hankin. Efficient field-sensitive pointer analysis for c. In Proceedings of the 5th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, pages 37–42, New York, NY, USA, 2004. ACM. [8] D.J. Pearce, P.H.J. Kelly, and C. Hankin. Efficient field-sensitive pointer analysis of c. ACM Transactions on Programming Languages and Systems, 30, 2007. [9] S.H. Yong, S. Horwitz, and T. Reps. Pointer analysis for programs with structures and casting. In Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, pages 91–103, New York, NY, USA, 1999. ACM. [10] M. Hind. Pointer analysis: Haven’t we solved this problem yet? In In workshop on Program Analysis for Software Tools and Engineering, pages 54–61, New York, NY, USA, 2001. ACM. [11] B. Hardekopf and C. Lin. The ant and the grasshopper: Fast and accurate pointer analysis for millions of lines of code. In Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 290– 299, New York, NY, USA, 2007. ACM. [12] F.M.Q. Pereira and D. Berlin. Wave propagation and deep propagation for pointer analysis. In Proceedings of the 2009 International Symposium on Code Generation and Optimization, pages 126–135,Washington, DC, USA, 2009. IEEE. [13] B. Hardekopf and C. Lin. Semi-sparse flow-sensitive pointer analysis. In Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 226–238, New York, NY, USA, 2009. ACM. [14] V. Kahlon. Bootstrapping: A technique for scalable flow and context-sensitive pointer alias analysis. In Proceedings of the 2008 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 249–259, New York, NY, USA, 2008. ACM. [15] C. Lattner, A. Lenharth, and V. Adve. Making context-sensitive points-to analysis with heap cloning practical for the real world. In Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 278–289, New York, NY, USA, 2007. ACM. [16] T.W. Sheng,W.G. Chen, andW.M. Zheng. A context-sensitive poiner analysis phase in open64 compiler. In Open64 Workshop in conjunction with IEEE/ACM International Symposium on Code Generation and Optimization, 2009. [17] N. Heintze and O. Tardieu. Ultra-fast aliasing analysis using cla: A million lines of c code in a second. In Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, pages 254–263, New York, NY, USA, 2001. ACM. [18] J. Whaley and M.S. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation, pages 131–144, New York, NY, USA, 2004. ACM. [19] D.J. Pearce, P.H.J. Kelly, and C. Hankin. Online cycle detection and difference propagation for pointer analysis. In Third IEEE International Workshop on Source Code Analysis and Manipulation, pages 3–12, 2003. [20] M. Mock, M. Das, C. Chambers, and S.J. Eggers. Dynamic points-to sets: A comparison with static analyses and potential application in program understanding and optimization. In Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, pages 66–72, New York, NY, USA, 2001. ACM. [21] T. Chen, J. Lin, W.C. Hsu, and P.C. Yew. An empirical study on the granularity of pointer analysis in c programs. In In 15th Workshop on Languages and Compilers for Parallel Computing, pages 157–171, 2002. [22] T. Chen, J. Lin,W.C. Hsu, and P.C. Yew. On the impact of naming methods for heaporiented pointers in c programs. In ISPAN ’02: 2002 Proceedings of the International Symposium on Parallel Architectures, Algorithm and Networks, Washington, DC, USA, 2002. IEEE. [23] C.K. Luk, R. Cohn, R. Muth, H. Patil, A. Klauser, G. Lowney, S. Wallace, V.J. Reddi, and K. Hazelwood. Pin: building customized program analysis tools with dynamic instrumentation. SIGPLAN Not., 40:190–200, June 2005. [24] X.Y. Zhang, A. Navabi, and S. Jagannathan. Alchemist: A transparent dependence distance profiling infrastructure. In Proceedings of the 2009 International Symposium on Code Generation and Optimization, pages 47–58, Washington, DC, USA, 2009. IEEE. [25] Valgrind. http://valgrind.org. [26] N. Nethercote and J. Seward. Valgrind: A framework for heavyweight dynamic binary instrumentation. In Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, pages 89–100, New York, NY, USA, 2007. ACM. [27] J. Lin, T. Chen, W.C. Hsu, P.C. Yew, R.D.C. Ju, T.F. Ngai, and S. Chan. A compiler framework for speculative analysis and optimizations. In Proceedings of the ACM SIGPLAN 2003 conference on Programming Language Design and Implementation, pages 289–299, New York, NY, USA, 2003. ACM. [28] Open64. http://www.open64.net. [29] A. Diwan, K.S. McKinley, and J.E.B. Moss. Type-based alias analysis. In PLDI ’98: Proceedings of the ACMSIGPLAN 1998 conference on Programming language design and implementation, pages 106–117, New York, NY, USA, 1998. ACM. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/8580 | - |
| dc.description.abstract | 在許多程式分析中，別名分析扮演了一個重要的角色。跟傳統缺乏動態資訊的靜態別名分析相比，使用執行監測的方法具有極大的潛力，因爲並不需要做過度的預測。在這篇論文中，我們提出一個用執行監測的框架以用來做別名分析。我們發現使用執行監測的方法可以比傳統的靜態別名分析獲得更多的非別名答案。儘管我們可以獲得更準確的別名分析，但執行時間並沒有太多的成長。我們也針對文本性質和域性質分別做了探討，並發現在文本性質中，非環式的方式較其他的方法有效以及域性質對別名分析是有很大的影響等結論。 | zh_TW |
| dc.description.abstract | Alias analysis plays an important role in various program analyses Comparing to traditional static alias analysis which struggles for precision under the lack of dynamic information, profile techniques show a great potential in this area since they don't need to make any over-approximation. In this paper, we propose an framework which uses profile techniques to perform alias analysis. We can get more 52 % queries than the worst case for 429.mcf. We also find that although we have a more accurate alias analysis, the performance has insignificance gain. And we simulate several schemes in context sensitivity and field sensitivity. We find that acyclic scheme in context sensitivity is useful and field sensitivity is important for alias analysis. | en |
| dc.description.provenance | Made available in DSpace on 2021-05-20T19:58:36Z (GMT). No. of bitstreams: 1 ntu-99-R97922143-1.pdf: 391182 bytes, checksum: 23c947a8e11430ff96924c7bf03a58a5 (MD5) Previous issue date: 2010 | en |
| dc.description.tableofcontents | Acknowledgement i
Chinese Abstract ii Abstract iii 1 Introduction 1 2 Related Work 6 3 System Design 8 3.1 Instrumentation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.2 Profile Library . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.3 Feedback . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 4 Experiments 15 5 Conclusion 19 Bibliography 20 | |
| dc.language.iso | en | |
| dc.title | 以執行監測爲基礎之別名分析 | zh_TW |
| dc.title | Profile-based Alias Analysis | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 98-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.coadvisor | 游本中 | |
| dc.contributor.oralexamcommittee | 吳真貞,徐慰中,陳添福 | |
| dc.subject.keyword | 別名分析,執行監測,Open64,記憶體分辨,文本性質,域性質, | zh_TW |
| dc.subject.keyword | Alias analysis,Profiling,Open64,Memory disambiguation,Context sensitivity,Field sensitivity, | en |
| dc.relation.page | 24 | |
| dc.rights.note | 同意授權(全球公開) | |
| dc.date.accepted | 2010-07-13 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
| 顯示於系所單位： | 資訊工程學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-99-1.pdf | 382.01 kB | Adobe PDF | 檢視/開啟 |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。