(A) bottom-up pointer analysis using the update history = 업데이트 기록에 기반한 상향방식 포인터 분석

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 669
  • Download : 0
Pointer analysis is an important part for the source code analysis of C programs. Most of pointer analysis algorithms are developed as top-down analyses, where the analyses are performed from callers to callees. Since such a scheme disables the analysis to operate on incomplete programs, existing top-down pointer analyses are not readily applicable to the modular software development process where individual software components are separately developed and subsequently linked with other components. Bottom-up pointer analyses can address this problem by performing analyses from callees to callers. However, analyzing the behavior of a procedure without utilizing any information on callers makes the different pointer behaviors of a procedure for different calls difficult to be traced precisely. In this thesis, we propose a bottom-up and flow- and context-sensitive pointer analysis algorithm based on a new bottom-up pointer analysis domain named the update history. The update history can not only abstract memory states of a procedure independently of the information on aliases between memory locations, and but also keep information on the order of side effects performed. Such characteristics of the update history not only enable pointer analyses to be formulated as bottom-up analyses, but also help bottom-up pointer analyzers to effectively identify killed side effects and relevant alias contexts, both of which are the main contributions of this thesis. Our bottom-up and flow- and context-sensitive pointer analysis is formulated as an inference algorithm of a type system for the update history. Then we formally prove the soundness of our pointer analysis algorithm, which has not been satisfactorily investigated for this kind of problem previously, using the well-developed type soundness machinery from the type system framework. The experiments performed on a pilot implementation show that our approach is cost-effective in a sense that the precision was im...
Advisors
Han, Tai-Sookresearcher한태숙researcher
Description
한국과학기술원 : 전산학전공,
Publisher
한국과학기술원
Issue Date
2009
Identifier
309340/325007  / 020015009
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전산학전공, 2009.2, [ viii, 91 p. ]

Keywords

program analysis; pointer analysis; modular analysis; strong update; type system; 프로그램 분석; 포인터 분석; 모듈라 분석; 강한 갱신; 타입시스템; program analysis; pointer analysis; modular analysis; strong update; type system; 프로그램 분석; 포인터 분석; 모듈라 분석; 강한 갱신; 타입시스템

URI
http://hdl.handle.net/10203/32922
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=309340&flag=dissertation
Appears in Collection
CS-Theses_Ph.D.(박사논문)
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