Extended sequential reasoning for data-race-free programs

Authors:
Laura Effinger-Dean;Hans-J. Boehm;Dhruva Chakrabarti;Pramod Joisha
Affiliations:
University of Washington;Hewlett-Packard Laboratories;Hewlett-Packard Laboratories;Hewlett-Packard Laboratories
Venue:
Proceedings of the 2011 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness
Year:
2011

Citing 8
Cited 6

The SPLASH-2 programs: characterization and methodological considerations

ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation

Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
The Java memory model

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundations of the C++ concurrency memory model

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
On Validity of Program Transformations in the Java Memory Model

ECOOP '08 Proceedings of the 22nd European conference on Object-Oriented Programming
Memory models: a case for rethinking parallel languages and hardware

Communications of the ACM
Mathematizing C++ concurrency

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A technique for the effective and automatic reuse of classical compiler optimizations on multithreaded code

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

RADISH: always-on sound and complete Ra Detection in Software and Hardware

Proceedings of the 39th Annual International Symposium on Computer Architecture
IFRit: interference-free regions for dynamic data-race detection

Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Position paper: nondeterminism is unavoidable, but data races are pure evil

Proceedings of the 2012 ACM workshop on Relaxing synchronization for multicore and manycore scalability
Input-covering schedules for multithreaded programs

Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
RedCard: redundant check elimination for dynamic race detectors

ECOOP'13 Proceedings of the 27th European conference on Object-Oriented Programming
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

Most multithreaded programming languages prohibit or discourage data races. By avoiding data races, we are guaranteed that variables accessed within a synchronization-free code region cannot be modified by other threads, allowing us to reason about such code regions as though they were single-threaded. However, such single-threaded reasoning is not limited to synchronization-free regions. We present a simple characterization of extended interference-free regions in which variables cannot be modified by other threads. This characterization shows that, in the absence of data races, important code analysis problems often have surprisingly easy answers. For instance, we can use local analysis to determine when lock and unlock calls refer to the same mutex. Our characterization can be derived from prior work on safe compiler transformations, but it can also be simply derived from first principles, and justified in a very broad context. In addition, systematic reasoning about overlapping interference-free regions yields insight about optimization opportunities that were not previously apparent. We give preliminary results for a prototype implementation of interference-free regions in the LLVM compiler infrastructure. We also discuss other potential applications for interference-free regions.