BIFER: a biphasic trace filter approach to scalable prediction of concurrency errors

Xi Chang, Zhuo Zhang, Peng Zhang, Jianxin Xue, Jianjun Zhao

研究成果: ジャーナルへの寄稿記事

1 引用 (Scopus)

抜粋

Predictive trace analysis (PTA), a static trace analysis technique for concurrent programs, can offer powerful capability support for finding concurrency errors unseen in a previous program execution. Existing PTA techniques always face considerable challenges in scaling to large traces which contain numerous critical events. One main reason is that an analyzed trace includes not only redundant memory accessing events and threads that cannot contribute to discovering any additional errors different from the found candidate ones, but also many residual synchronization events which still affect PTA to check whether these candidate ones are feasible or not even after removing the redundant events. Removing them from the trace can significantly improve the scalability of PTA without affecting the quality of the PTA results. In this paper, we propose a biphasic trace filter approach, BIFER in short, to filter these redundant events and residual events for improving the scalability of PTA to expose general concurrency errors. In addition, we design a model which indicates the lock history and the happens-before history of each thread with two kinds of ways to achieve the efficient filtering. We implement a prototypical tool BIFER for Java programs on the basis of a predictive trace analysis framework. Experiments show that BIFER can improve the scalability of PTA during the process of analyzing all of the traces.

元の言語英語
ページ(範囲)944-955
ページ数12
ジャーナルFrontiers of Computer Science
9
発行部数6
DOI
出版物ステータス出版済み - 10 20 2015
外部発表Yes

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用