Soundness of data flow analyses for weak memory models

Authors:
Jade Alglave;Daniel Kroening;John Lugton;Vincent Nimal;Michael Tautschnig
Affiliations:
Department of Computer Science, University of Oxford, UK;Department of Computer Science, University of Oxford, UK;Department of Computer Science, University of Oxford, UK;Department of Computer Science, University of Oxford, UK;Department of Computer Science, University of Oxford, UK
Venue:
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Year:
2011

Citing 32
Cited 3

Interprocedural constant propagation

SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
The SPARC architecture manual: version 8

The SPARC architecture manual: version 8
A generalized theory of bit vector data flow analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallelism for free: efficient and optimal bitvector analyses for parallel programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Points-to analysis in almost linear time

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
How to Make a Correct Multiprocess Program Execute Correctly on a Multiprocessor

IEEE Transactions on Computers
Pointer analysis for multithreaded programs

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Weak ordering—a new definition

ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principles of Program Analysis

Principles of Program Analysis
Shared Memory Consistency Models: A Tutorial

Computer
Analysis of Multithreaded Programs

SAS '01 Proceedings of the 8th International Symposium on Static Analysis
The Octagon Abstract Domain

WCRE '01 Proceedings of the Eighth Working Conference on Reverse Engineering (WCRE'01)
The Java memory model

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CheckFence: checking consistency of concurrent data types on relaxed memory models

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Model checking concurrent linux device drivers

Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
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
A Better x86 Memory Model: x86-TSO

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Relational Interprocedural Verification of Concurrent Programs

SEFM '09 Proceedings of the 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods
Symbolic Predictive Analysis for Concurrent Programs

FM '09 Proceedings of the 2nd World Congress on Formal Methods
x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors

Communications of the ACM
Memory models: a case for rethinking parallel languages and hardware

Communications of the ACM
Static analysis via abstract interpretation of the happens-before memory model

TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Compositional bitvector analysis for concurrent programs with nested locks

SAS'10 Proceedings of the 17th international conference on Static analysis
Relaxed-memory concurrency and verified compilation

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Static analysis of run-time errors in embedded critical parallel C programs

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
Litmus: running tests against hardware

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Stability in weak memory models

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Verifying fence elimination optimisations

SAS'11 Proceedings of the 18th international conference on Static analysis
Fences in weak memory models

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Trace-Based symbolic analysis for atomicity violations

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Types for relaxed memory models

TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
A formal hierarchy of weak memory models

Formal Methods in System Design
Software verification for weak memory via program transformation

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modern multi-core microprocessors implement weak memory consistency models; programming for these architectures is a challenge. This paper solves a problem open for ten years, and originally posed by Rinard: we identify sufficient conditions for a data flow analysis to be sound w.r.t. weak memory models. We first identify a class of analyses that are sound, and provide a formal proof of soundness at the level of trace semantics. Then we discuss how analyses unsound with respect to weak memory models can be repaired via a fixed point iteration, and provide experimental data on the runtime overhead of this method.