Affiliation:
1. University of Washington
2. University of California
3. Williams College
Abstract
Dynamic data race detectors are valuable tools for testing and validating concurrent software, but to achieve good performance they are typically implemented using sophisticated concurrent algorithms. Thus, they are ironically prone to the exact same kind of concurrency bugs they are designed to detect. To address these problems, we have developed V
erified
FT, a clean slate redesign of the F
ast
T
rack
race detector [19]. The V
erified
FT analysis provides the same precision guarantee as F
ast
T
rack
, but is simpler to implement correctly and efficiently, enabling us to mechanically verify an implementation of its core algorithm using CIVL [27]. Moreover, V
erified
FT provides these correctness guarantees without sacrificing any performance over current state-of-the-art (but complex and unverified) F
ast
T
rack
implementations for Java.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference58 articles.
1. Types for safe locking
2. Alexander Aiken and David Gay. 1998. Barrier Inference. In POPL. 243--354. 10.1145/268946.268974 Alexander Aiken and David Gay. 1998. Barrier Inference. In POPL. 243--354. 10.1145/268946.268974
3. The DaCapo benchmarks
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献