MAP-Coverage: A novel coverage criterion for testing thread-safe classes

• Main Authors: WANG, Zan, ZHAO, Yingquan, LIU, Shuang, SUN, Jun, CHEN, Xiang, LIN, Huarui
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2019
• Subjects: Software Engineering
• Online Access: https://ink.library.smu.edu.sg/sis_research/4964; https://ink.library.smu.edu.sg/context/sis_research/article/5967/viewcontent/map.pdf
• Institution: Singapore Management University

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 MAPcoverage and the effectiveness of a set of test executions.