Cheer-Sun D. Yang
ABSTRACT
One significant challenge in bringing the power of parallel machines to application programmers is providing them with a suite of software tools similar to the tools that sequential programmers currently utilize. In particular, automatic or semi-automatic testing tools for parallel programs are lacking. This paper describes our work in automatic generation of all-du-paths for testing parallel programs. Our goal is to demonstrate that, with some extension, sequential test data adequacy criteria are still applicable to parallel program testing. The concepts and algorithms in this paper have been incorporated as the foundation of our DELaware PArallel Software Testing Aid, della pasta.
- 1.A. Bertolino and M. Mart& Automatic generation of path covers based on the control flow analysis of computer programs. IEEE Trans. on Soft. Eng., 20(12):885-899, Dec. 1994. Google Scholar
Digital Library
- 2.L.A. Clarke. A system to generate test data and symbolically execute programs. IEEE Trans. on Soft. Eng., 2(3):215-222, Sept. 1976.Google ScholarDigital Library
- 3.H.N. Gabow, S. N. Maheshwari, and L. J. Osterweil. On two problems in the generation of program test paths. IEEE Trans. on Soft. Eng., SE-2(3):227-231, Sept. 1976.Google ScholarDigital Library
- 4.W. Gropp, E. Lusk, and A. Skjellum. Using MPI: Portable Parallel Programming with the Message Passing Interface. MIT Press, 1994. Google ScholarDigital Library
- 5.D. Grunwald and H. Srinivasan. Data flow equations for explicitly parallel programs. In Fourth A CM SIGPLAN Syrnposiurn on PHnciples and Practice of Parallel Programming, pages 159-168, California, USA, 1993. Google ScholarDigital Library
- 6.M. J. Harrold and M. L. Sofia. Efficient computation of interprocedural definition-use chains. A CM Transactions on Programming Languages and Systems, 16(2):175-204, Mar. 1994. Google ScholarDigital Library
- 7.B. Korel. Automated software test data generation. IEEE Trans. on Soft. Eng., 16(8):870-879, Aug. 1980. Google ScholarDigital Library
- 8.M.S. Lam. Introduction to the SUIF compiler system. In First SUIF Compiler Workshop, Jan. 1996.Google Scholar
- 9.D. Long and L.Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synehro~htion. Technical Report COINS 91-31, University of Massachusetts, Dept of Computer Science, July 1991.Google Scholar
- 10.S. Morasca and M. Pezz& Using high-level petfi nets for testing concurrent and real-time systems. In H. Zedan;'editor, Real-7~rne Systems: Theory and Applications, Proceedings of the conference organized by the British Computer Society, pages 119-131. Elsevier Science Publishings, 1990. 'Google Scholar
- 11.S. C. Ntafos and S. I./. Haldmi. On path cover problems in digraphs and applications to program testing. IEEE Trans. on Soft. Eng., 5(5):520-529, Sept. 1979. 'Google ScholarDigital Library
- 12.H. D. Pande, W. Landi, and B. G. Ryder. Interproi:edural def-use associations for C systems with single level pointers. IEEE Trans. on Soft. Eng., 20(5), 1994. Google ScholarDigital Library
- 13.K. C. Tal. Testing of concurrent software. In Proceedings of the 13th Annual International Computer Sol, are and Applications Conference, ~Sept. 1989.Google Scholar
- 14.R.N. Taylor, D. L. Levine, and C. D. Kelly. Structural testing ofconcurrentprograrns. IEEETrans. on Soft. Eng., 18(3):206-- 215, Mar. 1992. Google ScholarDigital Library
- 15.S. N. Weiss. A formal framework for studying concurrent program testing. In Proceedings of the 4th Symposium on Testing, Analysis, and Verification, pages 106-113, July 1988.Google Scholar
- 16.E. J. Weyuker. The evaluation of program-based software test data adequacy criteria. Communications of the A CM, 31(6):668--675, June 1988. Google ScholarDigital Library
- 17.C. Yang and L. L. Pollock. The challenges in automated testing of multithreaded programs. In the 14th International Conference on Testing Computer Software, pages 157-166, june 1997.Google Scholar
- 18.C.-S. D. Yang and L. L. Pollock. An algorithm for all-du-path testing coverage of shared memory parallel programs. In Sixth Asian Test Symposium, Nov. 1997. Google ScholarDigital Library
- 19.C.-S. D. Yang and L. L. Pollock. Semi-automatic temporal testing for parallel programs. Technical Report 98-05, U. of Delaware, Dept of CIS, Sept. 1997.Google Scholar
- 20.R.-D. Yang and C.-G. Chung. Path analysis testing of concurrent programs, lnfortrmtion and Software Technology, 34(1):43-56, Jan. 1992. Google ScholarDigital Library
Index Terms
- All-du-path coverage for parallel programs
Recommendations
All-du-path coverage for parallel programs
One significant challenge in bringing the power of parallel machines to application programmers is providing them with a suite of software tools similar to the tools that sequential programmers currently utilize. In particular, automatic or semi-...
Structural testing criteria for message-passing parallel programs
Parallel programs present some features such as concurrency, communication and synchronization that make the test a challenging activity. Because of these characteristics, the direct application of traditional testing is not always possible and adequate ...
An Algorithm for All-du-path Testing Coverage of Shared Memory Parallel Programs
ATS '97: Proceedings of the 6th Asian Test SymposiumLittle attention has focused on applying traditional testing methodology to parallel programs. This paper discusses issues involved in providing all-du-path coverage in shared memory parallel programs, and describes an algorithm for finding a set of ...
Comments