Effective generation of test sequences for structural testing of concurrent programs

Proceedings of the IEEE International Conference on Engineering of Complex Computer Systems, ICECCS

Volumn , Issue , 2005, Pages 539-548

  Wong, W Eric ^a   Lei, Yu ^b   Ma, Xiao ^a  

^a The University of Texas at Dallas   (United States)

^b The University of Texas at Arlington   (United States)

Author keywords

All edge criterion; All node criterion; Concurrent program testing; Reachability graph; Structural testing

Indexed keywords

GRAPH THEORY; PROBLEM SOLVING; SOFTWARE ENGINEERING;

ALL-EDGE CRITERIA; ALL-NODE CRITERIA; CONCURRENT PROGRAM TESTING; REACHABILITY GRAPH (RG); STRUCTURAL TESTING;

CONCURRENT ENGINEERING;

EID: 27144535342     PISSN: 27708527     EISSN: 27708535     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. L. A. Clarke, A. Podgurski, D. J. Richardson, and S. J. Zeil, "A Formal Evaluation of Data Flow Path Selection Criteria," IEEE Transaction. on Software Engineering, 15(11):1318-1332, November 1989.
2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to Algorithms" 2nd edition, The MIT Press, Cambridge, Massachusetts, 2002.
3. P. G. Frankl and E. J. Weyuker, "Data How Testing in the Presence of Unexecutable Paths," in Proceedings of Workshop on Software Testing, pp. 4-13, Banff, Alberta, Canada, July 1986.
4. W. E. Howden, "Reliability of the Path Analysis Testing Strategy," IEEE Transactions of Software Engineering, SE-2:208-214, September 1976.
5. T. Katayama, E. Itoh, and Z. Furukawa, "Test-case Generation for Concurrent Programs with the Testing Criteria Using Interaction Sequences, " in Proceedings of the 6th Asian-Pacific Software Engineering Conference, pp. 590-597, Takamatsu, JAPAN, December 1999.
6. P. V. Koppol, R. H. Carver, and K. C. Tai, "Incremental Integration Testing of Concurrent Programs," IEEE Transaction on Software Engineering, 28(6):607-623, June 2002.
7. R. Kruse, C. L. Tondo, and B. Leung, "Data Structures & Program Design in C," 2nd edition, Prentice Hall, 1997.
8. D. Lee and R. Hao, "Test Sequence Selection," in Proceedings of PSTV(Protocol Specification, Testing, and Verification)-FORTE (Formal Techniques for Networked and Distributed System), pp. 269-284, Cheju Island, Korea, August, 2001
9. Y. Lei and K. C. Tai, "Blocking-based Simultaneous Reachability Analysis of Asynchronous Message-Passing Programs," in Proceedings of International Symposium on Software Reliability Engineering, pp. 316-326, 2003.
10. S. C. Ntafos, "A Comparison of Some Structural Testing Strategies," IEEE Transactions of Software Engineering, SE-14(6):868-874, June 1988.
11. S. Rapps and E. J. Weyuker, "Selecting Software Test Data Using Data Flow Information," IEEE Transaction on Software Engineering, SE-11(4):367-375, April 1985.
12. M. Raynal, "Distributed Algorithms and Protocols," John Wiley & Sons, 1988.
13. A. Tanenbaum, "Computer Networks," Prentice Hall, 1996.
14. R. N. Taylor, D. L. Levine, and Cheryl D. Kelly, "Structural Testing of Concurrent Programs," IEEE Transaction on Software Engineering, 18(3):206-214, 1992.
15. The χSuds Toolsuite (http://xsuds.argreenhouse.com/), Telcordia Technology (formerly Bellcore or Bell Communications Research), Morristown, New Jersey, 1998.
16. R. D. Yang and C. G. Chung, "A Path Analysis Approach to Concurrent Program Testing," Information and Software Technology, 34(1):43-56, 1992.
17. C. Yang, A. L. Souter, and L. L. Pollock, "All-dupath Coverage for Parallel Programs," in Proceedings of International Symposium on Software Testing and Analysis, pp. 153-162, 1998.