DocumentCode :
3145018
Title :
Fault comprehension for concurrent programs
Author :
Sangmin Park
Author_Institution :
Georgia Inst. of Technol., Atlanta, GA, USA
fYear :
2013
fDate :
18-26 May 2013
Firstpage :
1444
Lastpage :
1446
Abstract :
Concurrency bugs are difficult to find because they occur with specific memory-access orderings between threads. Traditional bug-finding techniques for concurrent programs have focused on detecting raw-memory accesses representing the bugs, and they do not identify memory accesses that are responsible for the same bug. To address these limitations, we present an approach that uses memory-access patterns and their suspicious-ness scores, which indicate how likely they are to be buggy, and clusters the patterns responsible for the same bug. The evaluation on our prototype shows that our approach is effective in handling multiple concurrency bugs and in clustering patterns for the same bugs, which improves understanding of the bugs.
Keywords :
concurrency control; parallel programming; pattern clustering; program debugging; storage management; concurrency bug handling; concurrent bugs; concurrent programs; fault comprehension; memory access identification; memory-access ordering; memory-access pattern; pattern clustering; prototype evaluation; suspiciousness scores; Clustering algorithms; Computer bugs; Concurrent computing; Context; Facebook; Instruction sets; Programming;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Software Engineering (ICSE), 2013 35th International Conference on
Conference_Location :
San Francisco, CA
Print_ISBN :
978-1-4673-3073-2
Type :
conf
DOI :
10.1109/ICSE.2013.6606739
Filename :
6606739
Link To Document :
بازگشت