Software verification for weak memory via program transformation

Authors:
Jade Alglave;Daniel Kroening;Vincent Nimal;Michael Tautschnig
Affiliations:
University College London, UK, University of Oxford, UK;University of Oxford, UK;University of Oxford, UK;University of Oxford, UK, Queen Mary, University of London, UK
Venue:
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Year:
2013

Citing 24
Cited 3

An executable specification, analyzer and verifier for RMO (relaxed memory order)

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
How to Make a Correct Multiprocess Program Execute Correctly on a Multiprocessor

IEEE Transactions on Computers
Shared Memory Consistency Models: A Tutorial

Computer
CheckFence: checking consistency of concurrent data types on relaxed memory models

Proceedings of the 2007 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
On the verification problem for weak memory models

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reasoning about the implementation of concurrency abstractions on x86-TSO

ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
Verifying multi-threaded software using smt-based context-bounded model checking

Proceedings of the 33rd International Conference on Software Engineering
Understanding POWER multiprocessors

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Partial-coherence abstractions for relaxed memory models

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Automatic inference of memory fences

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Deciding robustness against total store ordering

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Stability in weak memory models

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Getting rid of store-buffers in TSO analysis

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Symmetry-aware predicate abstraction for shared-variable concurrent programs

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Threader: a constraint-based verifier for multi-threaded programs

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
A verification-based approach to memory fence insertion in relaxed memory systems

Proceedings of the 18th international SPIN conference on Model checking software
Fences in weak memory models

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
A memory model sensitive checker for c#

FM'06 Proceedings of the 14th international conference on Formal Methods
Soundness of data flow analyses for weak memory models

APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
What's decidable about weak memory models?

ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Counter-Example guided fence insertion under TSO

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Java memory model-aware model checking

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A formal hierarchy of weak memory models

Formal Methods in System Design

Partial orders for efficient bounded model checking of concurrent software

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Bounded model checking of high-integrity software

Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology
Replicated data types: specification, verification, optimality

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multiprocessors implement weak memory models, but program verifiers often assume Sequential Consistency (SC), and thus may miss bugs due to weak memory. We propose a sound transformation of the program to verify, enabling SC tools to perform verification w.r.t. weak memory. We present experiments for a broad variety of models (from x86-TSO to Power) and a vast range of verification tools, quantify the additional cost of the transformation and highlight the cases when we can drastically reduce it. Our benchmarks include work-queue management code from PostgreSQL.