All-du-path coverage for parallel programs

  • Yang C
  • Souter A
  • Pollock L
N/ACitations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

One significant challenge in bringing the power of parallel machines to application programmers is providing them with a suite of software tools similar to the tools that sequential programmers currently utilize. In particular, automatic or semi-automatic testing tools for parallel programs are lacking. This paper describes our work in automatic generation of all-du-paths for testing parallel programs. Our goal is to demonstrate that, with some extension, sequential test data adequacy criteria are still applicable to parallel program testing. The concepts and algorithms in this paper have been incorporated as the foundation of our DELaware PArallel Software Testing Aid, della pasta.

Cite

CITATION STYLE

APA

Yang, C.-S. D., Souter, A. L., & Pollock, L. L. (1998). All-du-path coverage for parallel programs. ACM SIGSOFT Software Engineering Notes, 23(2), 153–162. https://doi.org/10.1145/271775.271804

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free