research-article

The evolution of data races

Authors:

Caitlin Sadowski,

Jaeheon Yi,

Sunghun KimAuthors Info & Claims

MSR '12: Proceedings of the 9th IEEE Working Conference on Mining Software Repositories

Pages 171 - 174

Published: 02 June 2012 Publication History

Get Access

Abstract

Concurrency bugs are notoriously difficult to find and fix. Several prior empirical studies have identified the prevalence and challenges of concurrency bugs in open source projects, and several existing tools can be used to identify concurrency errors such as data races. However, little is known about how concurrency bugs evolve over time. In this paper, we examine the evolution of data races by analyzing samples of the committed code in two open source projects over a multi-year period. Specifically, we identify how the data races in these programs change over time.

References

[1]

S. Adve. Data races are evil with no exceptions: Technical perspective. Communications of the ACM, 53:84--84, Nov. 2010.

Digital Library

Google Scholar

[2]

Columba. http://columba.svn.sourceforge.net.

Google Scholar

[3]

C. Flanagan and S. N. Freund. The RoadRunner dynamic analysis framework for concurrent programs. In Program Analysis for Software Tools and Engineering (PASTE), 2010.

Digital Library

Google Scholar

[4]

jEdit. http://jedit.svn.sourceforge.net.

Google Scholar

[5]

B. Kasikci, C. Zamfir, and G. Candea. Data races vs. data race bugs: telling the difference with portend. In International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2012.

Digital Library

Google Scholar

[6]

S. Kim and M. Ernst. Which warnings should I fix first? In International Symposium on Foundations of Software Engineering (FSE), 2007.

Digital Library

Google Scholar

[7]

B. Livshits and T. Zimmermann. DynaMine: Finding common error patterns by mining software revision histories. ACM SIGSOFT Software Engineering Notes, 30(5):296--305, 2005.

Digital Library

Google Scholar

[8]

S. Lu, S. Park, E. Seo, and Y. Zhou. Learning from mistakes: A comprehensive study on real world concurrency bug characteristics. SIGPLAN Notices, 43(3):329--339, 2008.

Digital Library

Google Scholar

[9]

M. D. Penta, L. Cerulo, and L. Aversano. The life and death of statically detected vulnerabilities: An empirical study. Information and Software Technology, 51(10):1469--1484, 2009.

Digital Library

Google Scholar

[10]

C. Sadowski and S. Kurniawan. Heuristic evaluation of programming language features. In Workshop on Evaluation and Usability of Programming Languages and Tools (PLATEAU), 2011.

Digital Library

Google Scholar

[11]

W. Torres, G. Pinto, B. Fernandes, J. P. Oliveira, F. Ximenes, and F. Castor. Are Java programmers transitioning to multi-core? A large scale study of Java FLOSS. In Transitioning to MultiCore Workshop (TMC), 2011.

Digital Library

Google Scholar

[12]

Z. Yin, D. Yuan, Y. Zhou, S. Pasupathy, and L. Bairavasundaram. How do fixes become bugs? In International Symposium on Foundations of Software Engineering (FSE), 2011.

Digital Library

Google Scholar

Cited By

View all

Liu HChen YLu SZimmermann TCleland-Huang JSu Z(2016)Understanding and generating high quality patches for concurrency bugsProceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering10.1145/2950290.2950309(715-726)Online publication date: 1-Nov-2016
https://dl.acm.org/doi/10.1145/2950290.2950309
Gu RJin GSong LZhu LLu SDi Nitto EHarman MHeymans P(2015)What change history tells us about thread synchronizationProceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering10.1145/2786805.2786815(426-438)Online publication date: 30-Aug-2015
https://dl.acm.org/doi/10.1145/2786805.2786815

Recommendations

Healing data races on-the-fly
PADTAD '07: Proceedings of the 2007 ACM workshop on Parallel and distributed systems: testing and debugging

Testing of concurrent software is extremely difficult. Despite all the progress in the testing and verification technology, concurrent bugs, the most common of which are deadlocks and races, make it to the field. This paper describes a set of techniques,...
Data races vs. data race bugs: telling the difference with portend
ASPLOS '12

Even though most data races are harmless, the harmful ones are at the heart of some of the worst concurrency bugs. Alas, spotting just the harmful data races in programs is like finding a needle in a haystack: 76%-90% of the true data races reported by ...
Automatically classifying benign and harmful data races using replay analysis
PLDI '07: Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation

Many concurrency bugs in multi-threaded programs are due to dataraces. There have been many efforts to develop static and dynamic mechanisms to automatically find the data races. Most of the prior work has focused on finding the data races and ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

MSR '12: Proceedings of the 9th IEEE Working Conference on Mining Software Repositories

June 2012

262 pages

ISBN:9781467317610

General Chair:
Michele Lanza
University of Lugano, Switzerland
,
Program Chairs:
Massimiliano Di Penta
University of Sannio, Italy
,
Tao Xie
North Carolina State University

Publisher

IEEE Press

Publication History

Published: 02 June 2012

Check for updates

Qualifiers

Research-article

Conference

ICSE '12

Sponsor:

SIGSOFT
University of Zurich

ICSE '12: 34th International Conference on Software Engineering

June 2 - 3, 2012

Zurich, Switzerland

Upcoming Conference

ICSE 2025

2025 IEEE/ACM 46th International Conference on Software Engineering

April 26 - May 3, 2025

Ottawa , ON , Canada

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
72
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu HChen YLu SZimmermann TCleland-Huang JSu Z(2016)Understanding and generating high quality patches for concurrency bugsProceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering10.1145/2950290.2950309(715-726)Online publication date: 1-Nov-2016
https://dl.acm.org/doi/10.1145/2950290.2950309
Gu RJin GSong LZhu LLu SDi Nitto EHarman MHeymans P(2015)What change history tells us about thread synchronizationProceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering10.1145/2786805.2786815(426-438)Online publication date: 30-Aug-2015
https://dl.acm.org/doi/10.1145/2786805.2786815

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Healing data races on-the-fly

Data races vs. data race bugs: telling the difference with portend

Automatically classifying benign and harmful data races using replay analysis