메뉴 건너뛰기




Volumn , Issue , 2009, Pages 221-230

Building approximate calling context from partial call traces

Author keywords

Call context analysis; Calling context tree; Program understanding

Indexed keywords

CALL CONTEXT ANALYSIS; CALL TRACES; CALLING CONTEXT TREE; CONTEXT INFORMATION; EXACT SOLUTION; HIGH PROBABILITY; MAXIMAL MATCHING; MERGING STRATEGY; PERFORMANCE ANALYSIS; PROGRAM UNDERSTANDING; SEMI-AUTOMATIC TOOLS;

EID: 67650563221     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CGO.2009.12     Document Type: Conference Paper
Times cited : (18)

References (20)
  • 2
    • 20444404380 scopus 로고    scopus 로고
    • Standard Performance Evaluation Corporation, Specjvm98 benchmarks. http://www.spec.org/jvm98.
    • Specjvm98 Benchmarks
  • 3
    • 0030645124 scopus 로고    scopus 로고
    • Exploiting hardware performance counters with flow and context sensitive profiling
    • G. Ammons, T. Ball, and J. R. Larus, "Exploiting hardware performance counters with flow and context sensitive profiling," In PLDI, pages 85-96, 1997.
    • (1997) PLDI , pp. 85-96
    • Ammons, G.1    Ball, T.2    Larus, J.R.3
  • 7
    • 20444399287 scopus 로고    scopus 로고
    • Java just-in-time compiler and virtual machine improvements for server and middleware applications
    • N. Grcevski, A. Kielstra, K. Stoodley, M. Stoodley, V. Sundaresan, "Java just-in-time compiler and virtual machine improvements for server and middleware applications", VEE, 2004.
    • (2004) VEE
    • Grcevski, N.1    Kielstra, A.2    Stoodley, K.3    Stoodley, M.4    Sundaresan, V.5
  • 8
    • 1542680160 scopus 로고    scopus 로고
    • Fast, accurate call graph profiling
    • J. M. Spivey, "Fast, accurate call graph profiling," Software-Practice and Experience, 34(3):249-264, 2004.
    • (2004) Software-Practice and Experience , vol.34 , Issue.3 , pp. 249-264
    • Spivey, J.M.1
  • 9
    • 33745215241 scopus 로고    scopus 로고
    • Approximating the calling context tree via sampling
    • July
    • M. Arnold and Peter F. Sweeney, "Approximating the calling context tree via sampling. IBM Research Report, July 2000.
    • (2000) IBM Research Report
    • Arnold, M.1    Sweeney, P.F.2
  • 11
    • 32844470371 scopus 로고    scopus 로고
    • Low-overhead call path profiling of unmodified, optimized code
    • N. Froyd, J. Mellor-Crummey, and R. Fowler. Low-overhead call path profiling of unmodified, optimized code. In ICS '05, pages 81- 90, 2005.
    • (2005) ICS '05 , pp. 81-90
    • Froyd, N.1    Mellor-Crummey, J.2    Fowler, R.3
  • 12
    • 42149117768 scopus 로고    scopus 로고
    • Probabilistic Calling Context
    • M. D. Bond and K. S. McKinley, "Probabilistic Calling Context," OOPSLA 2007.
    • (2007) OOPSLA
    • Bond, M.D.1    McKinley, K.S.2
  • 15
    • 20444404380 scopus 로고    scopus 로고
    • Standard Performance Evaluation Corporation. Specjvm98 benchmarks. http://www.spec.org/jvm98.
    • Specjvm98 Benchmarks
  • 19
    • 34248160938 scopus 로고    scopus 로고
    • The DaCapo Benchmarks: Java Benchmarking Development and Analysis
    • S. Blackburn et al. "The DaCapo Benchmarks: Java Benchmarking Development and Analysis", OOPSLA 2006.
    • (2006) OOPSLA
    • Blackburn, S.1
  • 20
    • 33746100320 scopus 로고    scopus 로고
    • Accurate, Efficient, and adaptive calling context profiling
    • X. Zhuang, M. Serrano, T. Cain, J.D. Choi, "Accurate, Efficient, and adaptive calling context profiling", PLDI 2006.
    • (2006) PLDI
    • Zhuang, X.1    Serrano, M.2    Cain, T.3    Choi, J.D.4


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