Research Article
All-uses testing of shared memory parallel programs
Article first published online: 1 APR 2003
DOI: 10.1002/stvr.262
Copyright © 2003 John Wiley & Sons, Ltd.
Issue
1099-1689/asset/cover.gif?v=1&s=f770cbd14e5dbc2249e9f62de4d9f5779efcc8b7)
Software Testing, Verification and Reliability
Volume 13, Issue 1, pages 3–24, January/March 2003
Additional Information
How to Cite
Yang, C.-S. D. and Pollock, L. L. (2003), All-uses testing of shared memory parallel programs. Software Testing, Verification and Reliability, 13: 3–24. doi: 10.1002/stvr.262
Publication History
- Issue published online: 1 APR 2003
- Article first published online: 1 APR 2003
- Manuscript Revised: 6 DEC 2002
- Manuscript Received: 20 FEB 2002
- Abstract
- References
- Cited By
Keywords:
- structural software testing;
- shared memory parallel programming;
- all-uses testing
Abstract
Parallelism has become a way of life for many scientific programmers. A significant challenge in bringing the power of parallel machines to these programmers is providing them with a suite of software tools similar to the tools that sequential programmers currently utilize. Unfortunately, writing correct parallel programs remains a challenging task.In particular, automatic or semi-automatic testing tools for parallel programs are lacking. This paper takes a first step in developing an approach to providing all-uses coverage for parallel programs. A testing framework and theoretical foundations for structural testing are presented, including test data adequacy criteria and hierarchy, formulation and illustration of all-uses testing problems, classification of all-uses test cases for parallel programs, and both theoretical and empirical results with regard to what can be achieved with all-uses coverage for parallel programs. Copyright © 2003 John Wiley & Sons, Ltd.

1099-1689/asset/olbannerleft.jpg?v=1&s=f177ca3aecdb1afaf18649c31eb98c6a5a2ba179)
1099-1689/asset/olbannerright.jpg?v=1&s=c31cdb59b8e8855ed28bf83573e9f1693e3f9a0e)