一句话：提出面向线程安全类的内存访问模式覆盖准则 MAP-Coverage，并给出最大化该覆盖率的并发测试方法。
并发程序难以充分测试，传统代码覆盖准则面向顺序程序，难以有效刻画并发缺陷。本文提出一种面向线程安全类的新型代码覆盖准则 MAP-Coverage（memory-access patterns），其动机是并发缺陷常与特定内存访问模式相关，因而应全面覆盖这些模式。作者进一步提出最大化 MAP-Coverage 的测试方法，并实现为独立工具包。在 20 个基准程序上的实验表明，该工具包优于现有测试方法；实证结果还显示 MAP-Coverage 与一组测试执行的有效性之间存在正相关。
Concurrent programs must be thoroughly tested, as concurrency bugs are notoriously hard to detect. Code coverage criteria can be used to quantify the richness of a test suite (e.g., whether a program has been tested sufficiently) or provide practical guidelines on test case generation (e.g., as objective functions used in program fuzzing engines). Traditional code coverage criteria are, however, designed for sequential programs and thus ineffective for concurrent programs. In this work, we introduce a novel code coverage criterion for testing thread-safe classes called MAP-coverage (short for memory-access patterns). The motivation is that concurrency bugs are often correlated with certain memory-access patterns, and thus it is desirable to comprehensively cover all memory-access patterns. Furthermore, we propose a testing method for maximizing MAP-coverage. Our method has been implemented as a self-contained toolkit, and the experimental results on 20 benchmark programs show that our toolkit outperforms existing testing methods. Lastly, we show empirically that there exists positive correlation between MAP-coverage and the effectiveness of a set of test executions.
@inproceedings{paperbot5182,
title = {MAP-Coverage: A Novel Coverage Criterion for Testing Thread-Safe Classes},
author = {Zan Wang and Yingquan Zhao and Shuang Liu and Jun Sun and Xiang Chen and Huarui Lin},
booktitle = {ASE},
year = {2019},
doi = {10.1109/ase.2019.00073}
}