Maple: A coverage-driven testing tool for multithreaded programs

ACM SIGPLAN Notices

Volumn 47, Issue 10, 2012, Pages 485-502

  Yu, Jie ^a   Narayanasamy, Satish ^a   Pereira, Cristiano ^b   Pokam, Gilles ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

Concurrency; Coverage; Debugging; Idioms; Testing

Indexed keywords

CONCURRENCY; COVERAGE; HARD PROBLEMS; IDIOMS; INTERLEAVINGS; MULTI-THREADED PROGRAMS; NEW THREAD; ONLINE TECHNIQUE; REAL-WORLD APPLICATION; TEST INPUTS; TESTING TOOLS;

COMPUTER DEBUGGING; COMPUTER PROGRAMMING; TESTING;

COMPUTER SCIENCE;

EID: 84870471403     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/2398857.2384651     Document Type: Conference Paper

References (50)

1. P. Barford and M. Crovella. Generating representative web workloads for network and server performance evaluation. In SIGMETRICS, pages 151-160, 1998.
2. A. Bron, E. Farchi, Y. Magid, Y. Nir, and S. Ur. Applications of synchronization coverage. In PPOPP, pages 206-212, 2005.
3. S. Burckhardt, P. Kothari, M. Musuvathi, and S. Nagarakatte. A randomized scheduler with probabilistic guarantees of finding bugs. In ASPLOS, pages 167-178, 2010.
4. C. Cadar, D. Dunbar, and D. R. Engler. Klee: Unassisted and automatic generation of high-coverage tests for complex systems programs. In OSDI, pages 209-224, 2008.
5. K. E. Coons, S. Burckhardt, and M. Musuvathi. Gambit: effective unit testing for concurrency libraries. In PPOPP, pages 15-24, 2010.
6. O. Edelstein, E. Farchi, Y. Nir, G. Ratsaby, and S. Ur. Multithreaded java program test generation. IBM Systems Journal, 41(1): 111-125, 2002.
7. D. R. Engler and K. Ashcraft. Racerx: effective, static detection of race conditions and deadlocks. In SOSP, pages 237-252, 2003.
8. C. Flanagan and S. N. Freund. Fasttrack: efficient and precise dynamic race detection. Commun. ACM, 53(11): 93-101, 2010.
9. C. Flanagan, S. N. Freund, and J. Yi. Velodrome: a sound and complete dynamic atomicity checker for multithreaded programs. SIGPLAN Not., 43(6): 293-303, 2008.
10. C. Flanagan and P. Godefroid. Dynamic partial-order reduction for model checking software. In POPL, pages 110-121, 2005.
11. C. Flanagan and S. Qadeer. A type and effect system for atomicity. SIGPLAN Not., 38(5): 338-349, 2003.
12. P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems -An Approach to the State-Explosion Problem, volume 1032 of Lecture Notes in Computer ScienceLecture Notes in Computer ScienceLecture Notes in Computer Science. Springer, 1996.
13. P. Godefroid. Model checking for programming languages using verisoft. In POPL, pages 174-186, 1997.
14. P. Godefroid, N. Klarlund, and K. Sen. Dart: directed automated random testing. In PLDI, pages 213-223, 2005.
15. P. Godefroid, M. Y. Levin, and D. A. Molnar. Automated whitebox fuzz testing. In NDSS, 2008.
16. K. Havelund and T. Pressburger. Model checking java programs using java pathfinder. STTT, 2(4): 366-381, 2000.
17. J. Huang and C. Zhang. Persuasive prediction of concurrency access anomalies. In ISSTA, pages 144-154, 2011.
18. D. Jackson and C. Damon. Elements of style: Analyzing a software design feature with a counterexample detector. IEEE Trans. Software Eng., 22(7): 484-495, 1996.
19. V. Jagannath, M. Gligoric, D. Jin, Q. Luo, G. Rosu, and D. Marinov. Improved multithreaded unit testing. In SIGSOFT FSE, pages 223-233, 2011.
20. P. Joshi, C.-S. Park, K. Sen, and M. Naik. A randomized dynamic program analysis technique for detecting real deadlocks. In PLDI, pages 110-120, 2009.
21. V. Kahlon and C. Wang. Universal causality graphs: A precise happens-before model for detecting bugs in concurrent programs. In CAV, pages 434-449, 2010.
22. B. Krena, Z. Letko, and T. Vojnar. Coverage metrics for saturation-based and search-based testing of concurrent software. In RV, 2011.
23. Z. Lai, S.-C. Cheung, and W. K. Chan. Detecting atomic-set serializability violations in multithreaded programs through active randomized testing. In ICSE (1), pages 235-244, 2010.
24. S. Lu, W. Jiang, and Y. Zhou. A study of interleaving coverage criteria. In ESEC/SIGSOFT FSE, pages 533-536, 2007.
25. S. Lu, S. Park, C. Hu, X. Ma, W. Jiang, Z. Li, R. A. Popa, and Y. Zhou. Muvi: automatically inferring multi-variable access correlations and detecting related semantic and concurrency bugs. In SOSPSOSPSOSP, pages 103-116, 2007.
26. S. Lu, J. Tucek, F. Qin, and Y. Zhou. Avio: detecting atomicity violations via access interleaving invariants. In ASPLOS, pages 37-48, 2006.
27. B. Lucia, J. Devietti, K. Strauss, and L. Ceze. Atom-aid: Detecting and surviving atomicity violations. In ISCA, pages 277-288, 2008.
28. C.-K. Luk, R. S. Cohn, R. Muth, H. Patil, A. Klauser, P. G. Lowney, S. Wallace, V. J. Reddi, and K. M. Hazelwood. Pin: building customized program analysis tools with dynamic instrumentation. In PLDIPLDIPLDI, pages 190-200, 2005.
29. M. Musuvathi and S. Qadeer. Iterative context bounding for systematic testing of multithreaded programs. In PLDI, pages 446-455, 2007.
30. M. Musuvathi and S. Qadeer. Partial-order reduction for context-bounded state exploration. Technical Report MSRTR-2007-12, Microsoft Research, 2007.
31. M. Musuvathi and S. Qadeer. Fair stateless model checking. In PLDI, pages 362-371, 2008.
32. M. Musuvathi, S. Qadeer, T. Ball, G. Basler, P. A. Nainar, and I. Neamtiu. Finding and reproducing heisenbugs in concurrent programs. In OSDI, pages 267-280, 2008.
33. M. Naik, C.-S. Park, K. Sen, and D. Gay. Effective static deadlock detection. In ICSE, pages 386-396, 2009.
34. C. Pacheco and M. D. Ernst. Randoop: feedback-directed random testing for java. In OOPSLA Companion, pages 815-816, 2007.
35. C.-S. Park and K. Sen. Randomized active atomicity violation detection in concurrent programs. In SIGSOFT FSE, pages 135-145, 2008.
36. S. Park, S. Lu, and Y. Zhou. Ctrigger: exposing atomicity violation bugs from their hiding places. In ASPLOS, pages 25-36, 2009.
37. H. Patil, C. Pereira, M. Stallcup, G. Lueck, and J. Cownie. Pinplay: a framework for deterministic replay and reproducible analysis of parallel programs. In CGO, pages 2-11, 2010.
38. K. Sen. Race directed random testing of concurrent programs. In PLDI, pages 11-21, 2008.
39. E. Sherman, M. B. Dwyer, and S. G. Elbaum. Saturationbased testing of concurrent programs. In ESEC/SIGSOFT FSE, pages 53-62, 2009.
40. F. Sorrentino, A. Farzan, and P. Madhusudan. Penelope: weaving threads to expose atomicity violations. In SIGSOFT FSE, pages 37-46, 2010.
41. R. N. Taylor, D. L. Levine, and C. D. Kelly. Structural testing of concurrent programs. IEEE Trans. Software Eng., 18(3): 206-215, 1992.
42. M. Vaziri, F. Tip, and J. Dolby. Associating synchronization constraints with data in an object-oriented language. In POPL, pages 334-345, 2006.
43. J. W. Voung, R. Jhala, and S. Lerner. Relay: static race detection on millions of lines of code. In ESEC/SIGSOFT FSE, pages 205-214, 2007.
44. C.Wang, M. Said, and A. Gupta. Coverage guided systematic concurrency testing. In ICSE, pages 221-230, 2011.
45. D. Weeratunge, X. Zhang, and S. Jagannathan. Analyzing multicore dumps to facilitate concurrency bug reproduction. In ASPLOS, pages 155-166, 2010.
46. S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta. The splash-2 programs: Characterization and methodological considerations. In ISCA, pages 24-36, 1995.
47. C.-S. D. Yang, A. L. Souter, and L. L. Pollock. All-du-path coverage for parallel programs. In ISSTA, pages 153-162, 1998.
48. J. Yu and S. Narayanasamy. A case for an interleaving constrained shared-memory multi-processor. In ISCA, pages 325-336, 2009.
49. W. Zhang, J. Lim, R. Olichandran, J. Scherpelz, G. Jin, S. Lu, and T. W. Reps. Conseq: detecting concurrency bugs through sequential errors. In ASPLOS, pages 251-264, 2011.
50. W. Zhang, C. Sun, and S. Lu. Conmem: detecting severe concurrency bugs through an effect-oriented approach. In ASPLOS, pages 179-192, 2010.