Reachability testing of concurrent programs

We show how to perform reachability testing of concurrent programs using read and write operations. Also, we present results of empirical studies comparing reachability and nondeterministic testing. Our results indicate that reachability testing has advantages over nondeterministic testing. Article :. ACM Computing Surveys, , 43 2 : 1— Nanda M G, Ramesh S. Inter—procedural slicing of multithreaded programs with applications to Java. Generating variable strength combinatorial test suite with one—test—at—a—time.

Chinese Journals of Computers, , 35 12 : — Wang Z. Combinatorial test case generation and prioritization. Dissertation for the Doctoral Degree.

Nanjing: Southeast University, Ricart G, Agrawala A K. An optimal algorithm for mutual exclusion in computer networks. Communications of the ACM, , 24 1 : 9— Magee J, Kramer J. Concurrency State models and Java programs. Selective mutation testing for concurrent code.

Learning from mistakes: a comprehensive study on real world concurrency bug characteristics. Are mutants a valid substitute for real faults in software testing? A path analysis approach to concurrent program testing. Information and Software Technology, , 34 1 : 43— All—du—path coverage for parallel programs. Using partial—order methods in the formal validation of industrial concurrent programs. Using coverage and reachability testing to improve concurrent program testing quality.

Variable strength interaction testing of components. Schroeder P J. Black—box test reduction using input—output analysis. Chicago: Illinois Institute of Technology, Czerwonka J. Pairwise testing in real world: practical extensions to test case generator. Sen K. Race directed random testing of concurrent programs. Chapter Google Scholar. Huang J, Zhang C. Persuasive prediction of concurrency access anomalies. Flanagan C, Freund S N. RedCard: redundant check elimination for dynamic race detectors.

Maximal sound predictive race detection with control flow abstraction. Cai Y, Cao L. Article :. Date of Publication: 05 July DOI: Need Help?