%0 Journal Article %1 Mingxing:2016:DTB %A Zhang, Mingxing %A Wu, Yongwei %A Lu, Shan %A Qi, Shanxiang %A Ren, Jinglei %A Zheng, Weimin %D 2016 %J IEEE Transactions on Software Engineering %K Bugs Compensation Concurrency Mitigation OrderViolation RaceDetection %N 10 %P 899-917 %R 10.1109/TSE.2016.2531666 %T A Lightweight System for Detecting and Tolerating Concurrency Bugs %V 42 %X Along with the prevalence of multi-threaded programs, concurrency bugs have become one of the most important sources of software bugs. Even worse, due to the non-deterministic nature of concurrency bugs, these bugs are both difficult to detect and fix even after the detection. As a result, it is highly desired to develop an all-around approach that is able to not only detect them during the testing phase but also tolerate undetected bugs during production runs. However, existing bug-detecting and bug-tolerating tools are usually either<italic>1)</italic>constrained in types of bugs they can handle or<italic>2)</italic>requiring specific hardware supports for achieving an acceptable overhead. In this paper, we present a novel program invariant, name Anticipating Invariant (<sc>Ai</sc>), that can detect most types of concurrency bugs. More importantly,<sc>Ai</sc>can be used to anticipate many concurrency bugs before any irreversible changes have been made. Thus it enables us to develop a software-only system that is able to forestall failures with a simple thread stalling technique, which does not rely on execution roll-back and hence has good performance. Experiments with 35 real-world concurrency bugs demonstrate that<sc>Ai</sc>is capable of detecting and tolerating many important types of concurrency bugs, including both atomicity and order violations. It has also exposed two new bugs (confirmed by developers) that were never reported before in the literature. Performance evaluation with 6 representative parallel programs shows that<sc>Ai</sc>incurs negligible overhead (<inline-formula><tex-math notation="LaTeX">$ &lt; 1\%$</tex-math><alternatives><inline-graphic xlink:href="wu-ieq1-2531666.gif" xlink:type="simple" xmlns:xlink="http://www.w3.org/1999/xlink"/></alternatives></inline-formula>) for many nontrivial desktop and server applications.

@article{Mingxing:2016:DTB, abstract = {Along with the prevalence of multi-threaded programs, concurrency bugs have become one of the most important sources of software bugs. Even worse, due to the non-deterministic nature of concurrency bugs, these bugs are both difficult to detect and fix even after the detection. As a result, it is highly desired to develop an all-around approach that is able to not only detect them during the testing phase but also tolerate undetected bugs during production runs. However, existing bug-detecting and bug-tolerating tools are usually either<italic>1)</italic>constrained in types of bugs they can handle or<italic>2)</italic>requiring specific hardware supports for achieving an acceptable overhead. In this paper, we present a novel program invariant, name Anticipating Invariant (<sc>Ai</sc>), that can detect most types of concurrency bugs. More importantly,<sc>Ai</sc>can be used to anticipate many concurrency bugs before any irreversible changes have been made. Thus it enables us to develop a software-only system that is able to forestall failures with a simple thread stalling technique, which does not rely on execution roll-back and hence has good performance. Experiments with 35 real-world concurrency bugs demonstrate that<sc>Ai</sc>is capable of detecting and tolerating many important types of concurrency bugs, including both atomicity and order violations. It has also exposed two new bugs (confirmed by developers) that were never reported before in the literature. Performance evaluation with 6 representative parallel programs shows that<sc>Ai</sc>incurs negligible overhead (<inline-formula><tex-math notation="LaTeX">$ &lt; 1\%$</tex-math><alternatives><inline-graphic xlink:href="wu-ieq1-2531666.gif" xlink:type="simple" xmlns:xlink="http://www.w3.org/1999/xlink"/></alternatives></inline-formula>) for many nontrivial desktop and server applications.}, added-at = {2018-08-22T17:12:07.000+0200}, author = {Zhang, Mingxing and Wu, Yongwei and Lu, Shan and Qi, Shanxiang and Ren, Jinglei and Zheng, Weimin}, biburl = {https://www.bibsonomy.org/bibtex/2155d1c62e319eadacfd7e9150f2d50ed/gron}, description = {A Lightweight System for Detecting and Tolerating Concurrency Bugs - IEEE Journals & Magazine}, doi = {10.1109/TSE.2016.2531666}, interhash = {d38110e0d47808bc6a09b5adea91010e}, intrahash = {155d1c62e319eadacfd7e9150f2d50ed}, issn = {0098-5589}, journal = {IEEE Transactions on Software Engineering}, keywords = {Bugs Compensation Concurrency Mitigation OrderViolation RaceDetection}, month = oct, number = 10, pages = {899-917}, timestamp = {2018-08-22T17:12:07.000+0200}, title = {{A Lightweight System for Detecting and Tolerating Concurrency Bugs}}, volume = 42, year = 2016 }