A combinatorial testing strategy for concurrent programs

Software Testing Verification and Reliability

Volumn 17, Issue 4, 2007, Pages 207-225

  Lei, Yu ^a   Carver, Richard H ^b   Kacker, Raghu ^c   Kung, David ^a  

^a University of Texas at Arlington   (United States)

^b Krasnow Institute for Advanced Study   (United States)

^c NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY   (United States)

Author keywords

Combinatorial testing; Concurrency testing; Software testing; T way testing

Indexed keywords

ALGORITHMS; CONCURRENT ENGINEERING; FAULT DETECTION; SYNCHRONIZATION;

COMBINATORIAL TESTING; CONCURRENCY TESTING; T-WAY REACHABILITY TESTING;

SOFTWARE TESTING;

EID: 37249053332     PISSN: 09600833     EISSN: 10991689     Source Type: Journal    
DOI: 10.1002/stvr.369     Document Type: Article

References (42)

1. Tai KC. Testing of concurrent software. Proceedings of the 13th Annual International Computer Software and Applications Conference (COMPSAC), 1989; 62-64.
2. Ramalingam G. Context-sensitive synchronization-sensitive analysis is undecidable. ACM Transactions on Programming Languages and Systems 2000; 22(2):416-430.
3. Carver R, Lei Y. A general model for reachability testing of concurrent programs. Proceedings of International Conference on Formal Engineering Methods, 2004; 76-98.
4. Hwang GH, Tai KC, Huang TL. Reachability testing: An approach to testing concurrent software. International Journal of Software Engineering and Knowledge Engineering 1995; 5(4):493-510.
5. Lei Y, Carver RH. Reachability testing of concurrent programs. IEEE Transactions on Software Engineering 2006; 32(6):382-403.
6. Lei Y, Wong E. A novel framework for non-deterministic testing of message-passing programs. Proceedings of IEEE International Conference on High Assurance System Engineering (HASE), 2005; 66-75.
7. Edelstein O, Farchi E, Nir Y, Ratsaby G, Ur S. Multithread Java program test generation. IBM Systems Journal 2002; 41(1):111-125.
8. Stoller SD. Testing concurrent Java programs using randomized scheduling. Proceedings of the Second Workshop on Runtime Verification (RV~, also appears in Electronic Notes in Theoretical Computer Science, vol. 70, no. 4. Elsevier: Amsterdam, 2002; 1-16.
9. Yang RD, Chung CG. A path analysis approach to concurrent program testing. Information and Software Technology 1992; 34(1):43-56.
10. Yang C, Souter AL, Pollock LL. All-du-path coverage for parallel programs. International Symposium on Software Testing and Analysis (ISSTA), 1998; 153-162.
11. Taylor RN, Levine DL, Kelly CD. Structural testing of concurrent programs. IEEE Transactions on Software Engineering 1992; 18(3):206-214.
12. Corbett J, Dwyer M, Hatcliff J, Laubach S, Pasareanu C, Robby, Zheng H. Bandera: Extracting finite-state models from Java source code. Proceedings of International Conference on Software Engineering, June 2000; 439-448.
13. Havelund K, Pressburger T. Model Checking Java Programs using Java PathFinder. International Journal on Software Tools for Technology Transfer (STTT) 2000; 2(4):366-381.
14. Godefroid P. Software model checking: The VeriSoft approach. Formal Methods in System Design 2005; 26(2):77-101.
15. Nilsson R, Offutt J, Andler SF. Mutation-based testing criteria for timeliness. Proceedings of the 28th IEEE Annual Computer Software and Applications Conference (COMPSAC), 2004; 306-312.
16. Nilsson R, Offutt J, Mellin J. Test case generation for mutation-based testing of timeliness. Electronic Notes in Theoretical Computer Science. Springer: Berlin, 2006; 102-121.
17. Pettersson A, Thane H. Testing of multi-tasking real-time systems with critical sections. Proceedings of Ninth International Conference on Real-Time Computing Systems and Applications (RTCSA), 2003; 578-594.
18. Thane H. Monitoring, testing and debugging of distributed real-time systems. Ph.D. Thesis, Royal Institute of Technology, KTH, Stockholm, Sweden, 2000.
19. Cohen DM, Dalal SR, Fredman ML, Patton GC. The AETG system: An approach to testing based on combinatorial design. IEEE Transactions on Software Engineering 1997; 23(7):437-444.
20. Colboum CJ, Cohen MB, Turban RC. A deterministic density algorithm for pairwise interaction coverage. Proceedings of International Conference on Software Engineering (SE), 2004; 245-252.
21. Tung YW, Aldiwan WS. Automating test case generation for the new generation mission software system. Proceedings of IEEE Aerospace Conference, 2000; 431-437.
22. Bryce R, Colbourn CJ, Cohen MB. A framework of greedy methods for constructing interaction tests. Proceedings of IEEE International Conference on Software Engineering (ICSE), May 2005; 146-155.
23. Tai KC, Lei Y. A test generation strategy for pairwise testing. IEEE Transactions on Software Engineering 2002; 28(1):109-111.
24. Lei Y, Tai KC. In-parameter-order: A test generation strategy for pairwise testing. Proceedings of IEEE International High-Assurance Systems Engineering Symposium, 1998; 254-261.
25. Cohen MB, Colbourn CJ, Gibbons PB, Mugridge WB. Constructing test suites for interaction testing. Proceedings of IEEE International Conference on Software Engineering (ICSE), 2003; 38-48.
26. Burr K, Young W. Combinatorial test techniques: Table-based automation, test generation and code coverage. Proceedings of International Conference on Software Testing Analysis & Review, 1998; 503-513.
27. Dalal SR, Jain A, Karunanithi N, Leaton JM, Lott CM, Patton GC, Horowitz BM. Model-based testing in practice. Proceedings of International Conference on Software Engineering (ICSE), 1999; 285-294.
28. Kuhn R, Wallace D, Gallo A. Software fault interactions and implications for software testing. IEEE Transactions on Software Engineering 2004; 30(6):418-421.
29. Grindal M, Lindström B, Offutt J, Andler SF. An evaluation of combination testing strategies. Empirical Software Engineering 2006; 11(4):583-611.
30. Ammann PE, Offutt AJ. Using formal methods to derive test frames in category-partition testing. Proceedings of the Ninth Annual Conference on Computer Assurance (COMPASS), June 1994; 69-80.
31. Andrews GR. Foundations of Multithreaded, Parallel, and Distributed Programming. Addison-Wesley: Reading, MA, 2000.
32. Lamport L. Time, clocks, and the ordering of events in a distributed system. Communication of ACM 1978; 21(7):558-565.
33. Garg V. Concurrent and Distributed Computing in Java. Wiley: New York, 2004.
34. Ricart G, Agrawala AK. An optimal algorithm for mutual exclusion in computer networks. Communications of the ACM 1981; 24(1):9-17.
35. Suzuki I, Kasami T. A distributed mutual exclusion algorithm. ACM Transactions on Computer Systems 1985; 3(4): 344-349.
36. Ma Y, Offutt J, Kwon Y. MuJava: An automated class mutation system. Journal of Software Testing, Verification and Reliability 2005; 15(2):97-133.
37. μJava Home Page, http://ise.gmu.edu/~ofut/mujava/
38. Offutt J, Lee A, Rothermel G, Untch R, Zapf C. An experimental determination of sufficient mutation operators. ACM Transactions on Software Engineering Methodology 1996; 5(2):99-118.
39. Zhou J, Tai KC. Deadlock analysis of synchronous message-passing programs. Proceedings of International Symposium on Software Engineering for Parallel and Distributed Systems, 1999; 62-71.
40. Zhou J, Tai KC. Efficient deadlock analysis of clients/server systems with two-way communication. Proceedings of International Symposium on Software Reliability Engineering, 2001; 222-231.
41. Zhou J, Tai KC. Deadlock analysis of client/server programs. Proceedings of International Conference on Distributed Computing Systems, 2000; 494-491.
42. Andrews JH, Briand LC, Labiche Y. Is mutation an appropriate tool for testing experiments? Proceedings of IEEE International Conference on Software Engineering (ICSE), May 2005; 402-411.