메뉴 건너뛰기




Volumn 27, Issue 3 SPEC. ISS., 2005, Pages 313-334

Using static analysis to reduce dynamic analysis overhead

Author keywords

Dynamic debugging; Runtime types; Static analysis

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; PROGRAM DEBUGGING;

EID: 29344435994     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10703-005-3401-0     Document Type: Conference Paper
Times cited : (13)

References (22)
  • 5
    • 29344447608 scopus 로고    scopus 로고
    • Ckit. http://cm.bell-labs.com/cm/cs/what/smlnj/doc/ckit/.
  • 7
    • 0027568719 scopus 로고
    • Optimizing array bound checks using flow analysis
    • R. Gupta, "Optimizing array bound checks using flow analysis," ACM Letters on Programming Languages and Systems, Vol. 2, Nos. 1-4, pp. 135-150, 1993.
    • (1993) ACM Letters on Programming Languages and Systems , vol.2 , Issue.1-4 , pp. 135-150
    • Gupta, R.1
  • 9
    • 0027002125 scopus 로고
    • Global tagging optimization by type inference
    • F. Henglein, "Global tagging optimization by type inference," in LISP and Functional Programming, 1992, pp. 205-215.
    • (1992) LISP and Functional Programming , pp. 205-215
    • Henglein, F.1
  • 11
    • 84944192977 scopus 로고    scopus 로고
    • Debugging via run-time type checking
    • Fundamental Approaches to Software Engineering (FASE), Springer, Apr.
    • A. Loginov, S. Yong, S. Horwitz, and T. Reps, "Debugging via run-time type checking," in Fundamental Approaches to Software Engineering (FASE), volume 2029 of Lec. Notes in Comp. Sci., Springer, Apr. 2001, pp. 217-232.
    • (2001) Lec. Notes in Comp. Sci. , vol.2029 , pp. 217-232
    • Loginov, A.1    Yong, S.2    Horwitz, S.3    Reps, T.4
  • 16
    • 0030836322 scopus 로고    scopus 로고
    • Low-cost, concurrent checking of pointer and array accesses in C programs
    • H. Patil and C. Fischer, "Low-cost, concurrent checking of pointer and array accesses in C programs," Software-Practice and Experience, Vol. 27, No. 27, pp. 87-110, 1997.
    • (1997) Software-Practice and Experience , vol.27 , Issue.27 , pp. 87-110
    • Patil, H.1    Fischer, C.2
  • 17
    • 29344461103 scopus 로고    scopus 로고
    • The design and implementation of Valgrind
    • J. Seward, "The design and implementation of Valgrind," Technical report, http://developer.kde.org/~sewardj/, 2000.
    • (2000) Technical Report
    • Seward, J.1
  • 21
    • 1542295484 scopus 로고    scopus 로고
    • Elimination of Java array bounds checks in the presence of indirection
    • Department of Computer Science, University of Manchester, Feb.
    • M. Lujan, J.R,. Gurd, T.L. Freeman, and J. Miguel, "Elimination of Java array bounds checks in the presence of indirection," Technical Report CSPP-13, Department of Computer Science, University of Manchester, Feb. 2002.
    • (2002) Technical Report , vol.CSPP-13
    • Lujan, M.1    Gurd, J.R.2    Freeman, T.L.3    Miguel, J.4


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