Dataflow analysis for datarace-free programs

Authors:
Arnab De;Deepak D'Souza;Rupesh Nasre
Affiliations:
Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India;Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India;Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India
Venue:
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Year:
2011

Citing 18
Cited 1

Data flow equations for explicitly parallel programs

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Data flow analysis for verifying properties of concurrent programs

SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
Parallelism for free: efficient and optimal bitvector analyses for parallel programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Basic compiler algorithms for parallel programs

Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Pointer analysis for multithreaded programs

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
A unified approach to global program optimization

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Thread-Modular Verification for Shared-Memory Programs

ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Model Checking Programs

ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
The Java memory model

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Effective static race detection for Java

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Thread-modular shape analysis

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Iterative context bounding for systematic testing of multithreaded programs

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Foundations of the C++ concurrency memory model

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Dataflow analysis for concurrent programs using datarace detection

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Thread-modular model checking

SPIN'03 Proceedings of the 10th international conference on Model checking software
Compositional bitvector analysis for concurrent programs with nested locks

SAS'10 Proceedings of the 17th international conference on Static analysis
Thread-modular counterexample-guided abstraction refinement

SAS'10 Proceedings of the 17th international conference on Static analysis

Minimizing lifetime of sensitive data in concurrent programs

Proceedings of the 4th ACM conference on Data and application security and privacy

Quantified Score

Hi-index	0.01

Visualization

Abstract

Memory models for shared-memory concurrent programming languages typically guarantee sequential consistency (SC) semantics for datarace-free (DRF) programs, while providing very weak or no guarantees for non-DRF programs. In effect programmers are expected to write only DRF programs, which are then executed with SC semantics. With this in mind, we propose a novel scalable solution for dataflow analysis of concurrent programs, which is proved to be sound for DRF programs with SC semantics. We use the synchronization structure of the program to propagate dataflow information among threads without requiring to consider all interleavings explicitly.Given a dataflow analysis that is sound for sequential programs and meets certain criteria, our technique automatically converts it to an analysis for concurrent programs.