An algorithm for all-du-path testing coverage of shared memory parallel programs
Chengmo Yang, Lori Pollock · 2002
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.