A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Scaling predictive analysis of concurrent programs by removing trace redundancy
2013
ACM Transactions on Software Engineering and Methodology
Predictive trace analysis (PTA) of concurrent programs is powerful in finding concurrency bugs unseen in past program executions. Unfortunately, existing PTA solutions face considerable challenges in scaling to large traces. In this paper, we identify that a large percentage of events in the trace are redundant for presenting useful analysis results to the end user. Removing them from the trace can significantly improve the scalability of PTA without affecting the quality of the results. We
doi:10.1145/2430536.2430542
fatcat:2jkegwz4oreytox4gqhsomgthm