메뉴 건너뛰기




Volumn , Issue , 2004, Pages 269-280

AccMon: Automatically detecting memory-related bugs via program counter-based invariants

Author keywords

[No Author keywords available]

Indexed keywords

CHECK LOOK-ASIDE BUFFER (CLB); MICROARCHITECTURES; SOFTWARE BUGS; VALUE-BASED INVARIANCE;

EID: 21644447484     PISSN: 10724451     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (86)

References (40)
  • 3
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.H.1
  • 19
    • 0012582509 scopus 로고    scopus 로고
    • Backwards-compatible bounds checking for arrays and pointers in c programs
    • R. W. M. Jones and P. H. J. Kelly. Backwards-compatible bounds checking for arrays and pointers in c programs. In Automated and Algorithmic Debugging, 1997.
    • (1997) Automated and Algorithmic Debugging
    • Jones, R.W.M.1    Kelly, P.H.J.2
  • 20
    • 0028517833 scopus 로고
    • Cache profiling and the SPEC benchmarks: A case study
    • A. R. Lebeck and D. A. Wood. Cache profiling and the SPEC benchmarks: A case study. IEEE Computer, 27(10):15-26, 1994.
    • (1994) IEEE Computer , vol.27 , Issue.10 , pp. 15-26
    • Lebeck, A.R.1    Wood, D.A.2
  • 29
    • 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 & Experience, 27(1), 1997.
    • (1997) Software-Practice & Experience , vol.27 , Issue.1
    • Patil, H.1    Fischer, C.2


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