All-uses testing of shared memory parallel programs
Parallelism has become a way of life for many scientific programmers. A significant challenge in bringing the power of parallel machines to these programmers is providing them with a suite of software tools similar to the tools that sequential programmers currently utilize. Unfortunately, writing co...
Uloženo v:
| Vydáno v: | Software testing, verification & reliability Ročník 13; číslo 1; s. 3 - 24 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Chichester, UK
John Wiley & Sons, Ltd
01.01.2003
|
| Témata: | |
| ISSN: | 0960-0833, 1099-1689 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Parallelism has become a way of life for many scientific programmers. A significant challenge in bringing the power of parallel machines to these programmers is providing them with a suite of software tools similar to the tools that sequential programmers currently utilize. Unfortunately, writing correct parallel programs remains a challenging task.In particular, automatic or semi‐automatic testing tools for parallel programs are lacking. This paper takes a first step in developing an approach to providing all‐uses coverage for parallel programs. A testing framework and theoretical foundations for structural testing are presented, including test data adequacy criteria and hierarchy, formulation and illustration of all‐uses testing problems, classification of all‐uses test cases for parallel programs, and both theoretical and empirical results with regard to what can be achieved with all‐uses coverage for parallel programs. Copyright © 2003 John Wiley & Sons, Ltd. |
|---|---|
| Bibliografie: | istex:7915CC9D6F1F2D871CE7ADFF37D28B0AC0E63A29 ArticleID:STVR262 ark:/67375/WNG-JDGR09F7-3 |
| ISSN: | 0960-0833 1099-1689 |
| DOI: | 10.1002/stvr.262 |