Detecting data races in multi-threaded programs is a challenging problem in debugging, because the races could reveal nondeterministic program behavior in execution of such pro- grams. Nondeterministic runtime eects of a race are hard to identify and it is dicult to decide whether the reported data races can appear or not in the actual program executions. Previous techniques for detecting races cannot provide method to locate rst races in par- allel programs with random synchronization including lock/unlock mechnism. This paper presents an algorithm which extracts rst races by replaying the program and checking con- currency between sequenced traced data and candidate accesses, which are from a particular execution of parallel programs. We also present the correctness of our algorithm by showing that all the rst races are included in the traced accesses which are composed of key accesses.
목차
Abstract 1 Introduction 2 Background 2.1 Dynamic race detection 2.2 Program with Random Synchronization 2.3 The First Races 3 Algorithm for First Race Detection 4 Conclusion References
키워드
first racerace detectionpost-mortem analysisparallel program debuggingconcurrent programmingrandom synchronization
보안공학연구지원센터(IJSEIA) [Science & Engineering Research Support Center, Republic of Korea(IJSEIA)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Software Engineering and Its Applications
간기
월간
pISSN
1738-9984
수록기간
2008~2016
등재여부
SCOPUS
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Software Engineering and Its Applications Vol.7 No.5