메뉴 건너뛰기




Volumn 1824 LNCS, Issue , 2000, Pages 175-199

Polymorphic versus monomorphic flow-insensitive points-to analysis for C

Author keywords

[No Author keywords available]

Indexed keywords

STATIC ANALYSIS; TREES (MATHEMATICS);

EID: 84906099970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45099-3_10     Document Type: Conference Paper
Times cited : (50)

References (35)
  • 16
    • 0003523613 scopus 로고    scopus 로고
    • Flow-insensitive points-to analysis with term and set constraints
    • University of California, Berkeley, Aug
    • J. S. Foster, M. F̈ ahndrich, and A. Aiken. Flow-Insensitive Points-to Analysis with Term and Set Constraints. Technical Report UCB//CSD-97-964, University of California, Berkeley, Aug. 1997
    • (1997) Technical Report UCB//CSD-97-964
    • Foster, J.S.1    Fahndrich, M.2    Aiken, A.3
  • 17
    • 84906074872 scopus 로고    scopus 로고
    • Polymorphic versus monomorphic flowinsensitive points-to analysis for c
    • University of California, Berkeley, Apr
    • J. S. Foster, M. F̈ ahndrich, and A. Aiken. Polymorphic versus Monomorphic Flowinsensitive Points-to Analysis for C. Technical report, University of California, Berkeley, Apr. 2000
    • (2000) Technical Report
    • Foster, J.S.1    Fahndrich, M.2    Aiken, A.3
  • 21
  • 22
    • 0003503017 scopus 로고    scopus 로고
    • PhD thesis DIKU, Department of Computer Science, University of Copenhagen
    • C. Mossin. Flow Analysis of Typed Higher-Order Programs. PhD thesis, DIKU, Department of Computer Science, University of Copenhagen, 1996
    • (1996) Flow Analysis of Typed Higher-Order Programs
    • Mossin, C.1
  • 32
    • 0001020708 scopus 로고
    • Simple imperative polymorphism
    • A. K. Wright. Simple Imperative Polymorphism. In Lisp and Symbolic Computation 8, volume 4, pages 343-356, 1995
    • (1995) Lisp and Symbolic Computation 8 , vol.4 , pp. 343-356
    • Wright, A.K.1


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