Synthesizing Racy Tests
Data(s) |
2015
|
---|---|
Resumo |
Subtle concurrency errors in multithreaded libraries that arise because of incorrect or inadequate synchronization are often difficult to pinpoint precisely using only static techniques. On the other hand, the effectiveness of dynamic race detectors is critically dependent on multithreaded test suites whose execution can be used to identify and trigger races. Usually, such multithreaded tests need to invoke a specific combination of methods with objects involved in the invocations being shared appropriately to expose a race. Without a priori knowledge of the race, construction of such tests can be challenging. In this paper, we present a lightweight and scalable technique for synthesizing precisely these kinds of tests. Given a multithreaded library and a sequential test suite, we describe a fully automated analysis that examines sequential execution traces, and produces as its output a concurrent client program that drives shared objects via library method calls to states conducive for triggering a race. Experimental results on a variety of well-tested Java libraries yield 101 synthesized multithreaded tests in less than four minutes. Analyzing the execution of these tests using an off-the-shelf race detector reveals 187 harmful races, including several previously unreported ones. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/52560/1/ACM_Sig_Not_50-6_175_2015.pdf Samak, Malavika and Ramanathan, Murali Krishna and Jagannathan, Suresh (2015) Synthesizing Racy Tests. In: ACM SIGPLAN NOTICES, 50 (6). pp. 175-185. |
Publicador |
ASSOC COMPUTING MACHINERY |
Relação |
http://dx.doi.org/10.1145/2737924.2737998 http://eprints.iisc.ernet.in/52560/ |
Palavras-Chave | #Computer Science & Automation (Formerly, School of Automation) |
Tipo |
Journal Article PeerReviewed |