ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 Characterizing Non-Deadlock Concurrency Bug Fixes in Open-Source Java Programs
Cited 4 time in scopus Download 1 time Share share facebook twitter linkedin kakaostory
저자
유미선, 마유승, 배두환
발행일
201604
출처
Symposium on Applied Computing (SAC) 2016, pp.1534-1537
DOI
https://dx.doi.org/10.1145/2851613.2851967
협약과제
15DS1100, DDS 기반의 통합개발지원환경 개발, 박승민
초록
Fixing a non-deadlock concurrency bug is a difficult job that sometimes introduces additional bugs and requires a long time. To overcome this difficulty and efficiently perform fixing jobs, engineers should have broad knowledge of various fix patterns, and the ability to select the most proper one among those patterns based on quantitative data gathered from real-world bug databases. In this paper, we provide a real-world characteristic study on the fixes of non-deadlock concurrency bugs to help engineers responsible for program maintenance. In particular, we examine various fix patterns and the factors that influence the selection of those patterns with respect to the preexistence of locks and failure types. Our results will provide useful information for engineers who write bug patches, and researchers who study efficient testing and fixing techniques.
키워드
Bug fix, Concurrency bug, Software maintenance
KSP 제안 키워드
Bug fix, Characteristic study, Efficient testing, Java Programs, Long Time, Open source, Quantitative data, Real-world, concurrency bugs, software maintenance