메뉴 건너뛰기




Volumn , Issue , 2004, Pages 43-48

Importance of heap specialization in pointer analysis

Author keywords

Context sensitivity; Heap specialization; Pointer analysis

Indexed keywords

GRAPH THEORY; INFORMATION ANALYSIS; ITERATIVE METHODS; RESOURCE ALLOCATION; SEMANTICS; SOFTWARE ENGINEERING;

EID: 4544366942     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/996821.996836     Document Type: Conference Paper
Times cited : (34)

References (13)
  • 9
    • 0242612538 scopus 로고    scopus 로고
    • Data structure analysis: A fast and scalable context-sensitive heap analysis
    • CS Dept., University of Illinois
    • Chris Lattner and Vikram Adve. Data Structure Analysis: A Fast and Scalable Context-Sensitive Heap Analysis. Technical Report, CS Dept., University of Illinois. 2003.
    • (2003) Technical Report
    • Lattner, C.1    Adve, V.2
  • 10
    • 0038559332 scopus 로고    scopus 로고
    • Efficient computation of parameterized pointer information for interprocedural analyses
    • Donglin Liang and Mary Jean Harrold. Efficient computation of parameterized pointer information for interprocedural analyses. In SAS, 2001.
    • (2001) SAS
    • Liang, D.1    Harrold, M.J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.