GAMBIT: Effective Unit Testing for Concurrency Libraries

Katherine E. Coons, Madanlal Musuvathi, and Sebastian Burckhardt

Abstract

As concurrent programming becomes prevalent, software providers

are investing in concurrency libraries to improve programmer productivity.

Concurrency libraries improve productivity by hiding

error-prone, low-level synchronization from programmers and providing

higher-level concurrent abstractions. Testing such libraries

is difficult, however, because concurrency failures often manifest

only under particular scheduling circumstances. Current best testing

practices are often inadequate: heuristic-guided fuzzing is not

systematic, systematic schedule enumeration does not find bugs

quickly, and stress testing is neither systematic nor fast.

To address these shortcomings, we propose a prioritized search

technique called GAMBIT that combines the speed benefits of

heuristic-guided fuzzing with the soundness, progress, and reproducibility

guarantees of stateless model checking. GAMBIT

combines known techniques such as partial-order reduction and

preemption-bounding with a generalized best-first search framework

that prioritizes schedules likely to expose bugs. We evaluate

GAMBIT’s effectiveness on newly released concurrency libraries

for Microsoft’s .NET framework. Our experiments show

that GAMBIT finds bugs more quickly than prior stateless model

checking techniques without compromising coverage guarantees

or reproducibility.

Details

Publication typeInproceedings
Published inProceedings of the 15th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming
PublisherAssociation for Computing Machinery, Inc.
> Publications > GAMBIT: Effective Unit Testing for Concurrency Libraries