메뉴 건너뛰기




Volumn , Issue , 2007, Pages 22-31

Automatically classifying benign and harmful data racesallusing replay analysis

Author keywords

Benign data races; Concurrency Bbugs; Replay

Indexed keywords

CONFLICTING MEMORY OPERATIONS; DATARACES; MULTI-THREADED PROGRAM; PROGRAM EXECUTION;

EID: 35548939899     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250734.1250738     Document Type: Conference Paper
Times cited : (176)

References (38)
  • 2
    • 37849019596 scopus 로고    scopus 로고
    • R. Agarwal, A. Sasturkar, L. Wang, and S. D. Stoller. Optimized runtime race detection and atomicity checking using partial discovered types. In In Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering, pages 233-242, 2005.
    • R. Agarwal, A. Sasturkar, L. Wang, and S. D. Stoller. Optimized runtime race detection and atomicity checking using partial discovered types. In In Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering, pages 233-242, 2005.
  • 8
    • 0026274708 scopus 로고    scopus 로고
    • J. M. Crummey. On-the-fly detection of data races for programs with nested fork-join parallelism. In Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing, pages 24-33, 199.1.
    • J. M. Crummey. On-the-fly detection of data races for programs with nested fork-join parallelism. In Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing, pages 24-33, 199.1.
  • 9
    • 0034772229 scopus 로고    scopus 로고
    • D. L. Detlefs, P. A. Martin, M. Moir, and Jr. G. L. Steele. Lockfree reference counting. In PODC '01: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, pages 190-199, 2001.
    • D. L. Detlefs, P. A. Martin, M. Moir, and Jr. G. L. Steele. Lockfree reference counting. In PODC '01: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, pages 190-199, 2001.
  • 12
    • 31844452361 scopus 로고    scopus 로고
    • Vyrd: Verifying concurrent programs by runtime refinement-violation detection
    • T. Elmas, S. Tasiran, and S. Qadeer. Vyrd: verifying concurrent programs by runtime refinement-violation detection. In PLDI, 2005.
    • (2005) PLDI
    • Elmas, T.1    Tasiran, S.2    Qadeer, S.3
  • 17
    • 0017996760 scopus 로고
    • Time, clocks, and the ordering of events in a distributed system
    • L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565, 1978.
    • (1978) Communications of the ACM , vol.21 , Issue.7 , pp. 558-565
    • Lamport, L.1
  • 22
    • 85093854272 scopus 로고    scopus 로고
    • Detecting data races using dynamic escape analysis based on read barrier
    • May
    • H. Nishiyama. Detecting data races using dynamic escape analysis based on read barrier. Third Virtual Machine Research & Technology Symposium, pages 127-138, May 2004.
    • (2004) Third Virtual Machine Research & Technology Symposium , pp. 127-138
    • Nishiyama, H.1
  • 24
    • 85086057763 scopus 로고    scopus 로고
    • Online data-race detection via coherency guarantees
    • D. Perkovic and P. J. Keleher. Online data-race detection via coherency guarantees. In OSDI, pages 47-57, 1996.
    • (1996) OSDI , pp. 47-57
    • Perkovic, D.1    Keleher, P.J.2
  • 27
    • 0038346243 scopus 로고    scopus 로고
    • Reenact: Using thread-level speculation mechanisms to debug data races in multithreaded codes
    • San Diego, CA, June
    • M. Prvulovic and J. Torreias. Reenact: Using thread-level speculation mechanisms to debug data races in multithreaded codes. In 30th Annual International Symposium on Computer Architecture, San Diego, CA, June 2003.
    • (2003) 30th Annual International Symposium on Computer Architecture
    • Prvulovic, M.1    Torreias, J.2


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