Generating data race witnesses by an SMT-based analysis

Authors:
Mahmoud Said;Chao Wang;Zijiang Yang;Karem Sakallah
Affiliations:
Department of Computer Science, Western Michigan Univerisity, Kalamazoo, MI;NEC Laboratories America, Princeton, NJ;Department of Computer Science, Western Michigan Univerisity, Kalamazoo, MI;Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan
Venue:
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Year:
2011

Citing 18
Cited 4

Eraser: a dynamic data race detector for multithreaded programs

ACM Transactions on Computer Systems (TOCS)
Type-based race detection for Java

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
A parameterized type system for race-free Java programs

OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Using Runtime Analysis to Guide Model Checking of Java Programs

Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Concurrent Bug Patterns and How to Test Them

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
RacerX: effective, static detection of race conditions and deadlocks

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
The Java memory model

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
LOCKSMITH: context-sensitive correlation analysis for race detection

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Using model checking with symbolic execution to verify parallel numerical programs

Proceedings of the 2006 international symposium on Software testing and analysis
Conditional must not aliasing for static race detection

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Goldilocks: a race and transaction-aware java runtime

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
RELAY: static race detection on millions of lines of code

Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
FastTrack: efficient and precise dynamic race detection

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Symbolic Predictive Analysis for Concurrent Programs

FM '09 Proceedings of the 2nd World Congress on Formal Methods
Fast and accurate static data-race detection for concurrent programs

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Coverage guided systematic concurrency testing

Proceedings of the 33rd International Conference on Software Engineering
A fast linear-arithmetic solver for DPLL(T)

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Reasoning about threads communicating via locks

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification

Sound predictive race detection in polynomial time

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Predicting null-pointer dereferences in concurrent programs

Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering
Predicting serializability violations: SMT-Based search vs. DPOR-Based search

HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Race directed scheduling of concurrent programs

Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data race is one of the most dangerous errors in multithreaded programming, and despite intensive studies, it remains a notorious cause of failures in concurrent systems. Detecting data races is already a hard problem, and yet it is even harder for a programmer to decide whether or how a reported data race can appear in the actual program execution. In this paper we propose an algorithm for generating debugging aid information called witnesses, which are concrete thread schedules that can deterministically trigger the data races. More specifically, given a concrete execution trace, e.g. non-erroneous one which may have triggered a warning in Eraser-style data race detectors, we use a symbolic analysis based on SMT solvers to search for a data race witness among alternative interleavings of events of that trace. Our symbolic analysis precisely encodes the sequential consistency semantics using a scalable predictive model to ensure that the reported witness is always feasible.