An Algorithm for All-du-path Testing Coverage of Shared Memory Parallel Programs

Authors:
C. -S. D. Yang;L. L. Pollock
Affiliations:
-;-
Venue:
ATS '97 Proceedings of the 6th Asian Test Symposium
Year:
1997

Citing 0
Cited 2

All-du-path coverage for parallel programs

Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Research in concurrent software testing: a systematic review

Proceedings of the Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging

Quantified Score

Hi-index	0.00

Visualization

Abstract

Little 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 paths covering all define-use pairs. To our knowledge, this is the first effort of this kind.