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

C.-S. D. Yang; L. L. Pollock

doi:10.1109/ATS.1997.643968

A
ATS
1997
Sixth Asian Test Symposium (ATS'97)
Abstract - An Algorithm for All-du-path Testing Coverage of Shared Memory Parallel Programs

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/EndNote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by C.-S. D. Yang Articles by L. L. Pollock

Sixth Asian Test Symposium (ATS'97)

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

Akita, JAPAN

November 17-November 18

ISBN: 0-8186-8209-4

	ASCII Text	x
	C.-S. D. Yang, L. L. Pollock, "An Algorithm for All-du-path Testing Coverage of Shared Memory Parallel Programs," 2012 IEEE 21st Asian Test Symposium, pp. 263, Sixth Asian Test Symposium (ATS'97), 1997.

	BibTex	x
	@article{ 10.1109/ATS.1997.643968, author = {C.-S. D. Yang and L. L. Pollock}, title = {An Algorithm for All-du-path Testing Coverage of Shared Memory Parallel Programs}, journal ={2012 IEEE 21st Asian Test Symposium}, volume = {0}, year = {1997}, issn = {1081-7735}, pages = {263}, doi = {http://doi.ieeecomputersociety.org/10.1109/ATS.1997.643968}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - 2012 IEEE 21st Asian Test Symposium TI - An Algorithm for All-du-path Testing Coverage of Shared Memory Parallel Programs SN - 1081-7735 SP EP A1 - C.-S. D. Yang, A1 - L. L. Pollock, PY - 1997 KW - structural software testing KW - all-du-path coverage KW - shared memory parallel programming. VL - 0 JA - 2012 IEEE 21st Asian Test Symposium ER -

C.-S. D. Yang, University of Delaware

L. L. Pollock, University of Delaware

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ATS.1997.643968

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.

Index Terms:

structural software testing, all-du-path coverage, shared memory parallel programming.

Citation:

C.-S. D. Yang, L. L. Pollock, "An Algorithm for All-du-path Testing Coverage of Shared Memory Parallel Programs," ats, pp.263, Sixth Asian Test Symposium (ATS'97), 1997

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.