Don't sit on the fence: A static analysis approach to automatic fence insertion

Abstract

Modern architectures rely on memory fences to prevent undesired weakenings of memory consistency. As the fences' semantics may be subtle, the automation of their placement is highly desirable. But precise methods for restoring consistency do not scale to deployed systems code. We choose to trade some precision for genuine scalability: our technique is suitable for large code bases. We implement it in our new musketeer tool, and detail experiments on more than 350 executables of packages found in Debian Linux 7.1, e.g. memcached (about 10000 LoC).

19 pages, 19 figures

Cited by in corpus (7)

• The Efficient Server Audit Problem, Deduplicated Re-execution, and the Web
• Property-Driven Fence Insertion using Reorder Bounded Model Checking
• Locality and Singularity for Store-Atomic Memory Models
• Lazy TSO Reachability
• Compiling a Calculus for Relaxed Memory: Practical constraint-based low-level concurrency
• Mending Fences with Self-Invalidation and Self-Downgrade
• Optimizing Solution Quality in Synchronization Synthesis