Title :
An algorithm for all-du-path testing coverage of shared memory parallel programs
Author :
Yang, C.-S.D. ; Pollock, L.L.
Author_Institution :
Dept. of Comput. & Inf. Sci., Delaware Univ., Newark, DE, USA
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
Keywords :
shared memory systems; all-du-path testing coverage; data structures; hybrid method; shared memory parallel programs; Automatic testing; Collaboration; Concurrent computing; High performance computing; Knowledge management; Libraries; Parallel processing; Parallel programming; Sequential analysis; Yarn;
Conference_Titel :
Test Symposium, 1997. (ATS '97) Proceedings., Sixth Asian
Conference_Location :
Akita
Print_ISBN :
0-8186-8209-4
DOI :
10.1109/ATS.1997.643968
