Concurrency bug localization using shared memory access pairs

Wenwen Wang, Chenggang Wu, Pen Chung Yew, Xiang Yuan, Zhenjiang Wang, Jianjun Li, Xiaobing Feng

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

Non-determinism in concurrent programs makes their debugging much more challenging than that in sequential programs. To mitigate such difficulties, we propose a new technique to automatically locate buggy shared memory accesses that triggered concurrency bugs. Compared to existing fault localization techniques that are based on empirical statistical approaches, this technique has two advantages. First, as long as enough successful runs of a concurrent program are collected, the proposed technique can locate buggy memory accesses to the shared data even with only one single failed run captured, as opposed to the need of capturing multiple failed runs in other statistical approaches. Second, the proposed technique is more precise because it considers memory accesses in those failed runs that terminate prematurely.

Original languageEnglish (US)
Title of host publicationProceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP
Pages375-376
Number of pages2
Volume49
DOIs
StatePublished - Aug 1 2014
Event2014 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2014 - Orlando, FL, United States
Duration: Feb 15 2014Feb 19 2014

Publication series

NameProceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Other

Other2014 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2014
CountryUnited States
CityOrlando, FL
Period2/15/142/19/14

Keywords

  • Bug Localization
  • Shared memory access pair

Fingerprint Dive into the research topics of 'Concurrency bug localization using shared memory access pairs'. Together they form a unique fingerprint.

Cite this