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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call