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žené v:
| Vydané v: | Software testing, verification & reliability Ročník 13; číslo 1; s. 3 - 24 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Chichester, UK
John Wiley & Sons, Ltd
01.01.2003
|
| Predmet: | |
| ISSN: | 0960-0833, 1099-1689 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | 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. |
|---|---|
| AbstractList | 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. |
| Author | Pollock, Lori L. Yang, Cheer-Sun D. |
| Author_xml | – sequence: 1 givenname: Cheer-Sun D. surname: Yang fullname: Yang, Cheer-Sun D. organization: Computer Science Department, West Chester University of PA, West Chester, PA 19383, U.S.A – sequence: 2 givenname: Lori L. surname: Pollock fullname: Pollock, Lori L. email: pollock@cis.udel.edu organization: Computer and Information Sciences, University of Delaware, Newark, DE 19716, U.S.A |
| BookMark | eNp1j81KAzEURoNUsK2CjzBLN6k3yTQzWZZqq1IUtOoy3EmTOpqZKcn407e3pSIouvo25ztweqRTN7Ul5JjBgAHw09i-hQGXfI90GShFmcxVh3RBSaCQC3FAejE-A4BUUnWJGHlPX6ONSWtjW9bLpHFJfMJgF0llqyaskxUG9N76ZBWaZcAqHpJ9hz7ao6_tk_vJ-Xx8QWc308vxaEaNAMZpwQvGrc2MdKkr0gUDrgSzykm12Sw3CAzyXA0FCpQCjUwXkhvMCuVyzFLRJyc7rwlNjME6vQplhWGtGehtrN7G6k3sBh38Qk3ZYls2dRuw9H8d6O7wXnq7_les7-YPtz_4Mrb245vH8KJlJrKhfrye6quz6S2oSaaF-ASLDncl |
| CitedBy_id | crossref_primary_10_1002_cpe_2937 crossref_primary_10_1002_cpe_995 crossref_primary_10_1016_j_infsof_2019_07_002 crossref_primary_10_1016_j_infsof_2016_09_003 crossref_primary_10_1016_j_procs_2013_05_178 crossref_primary_10_1002_cpe_1297 crossref_primary_10_1016_j_parco_2020_102665 crossref_primary_10_1007_s11219_017_9376_4 crossref_primary_10_1002_stvr_1568 |
| Cites_doi | 10.1109/32.221133 10.1109/32.345831 10.1109/32.238581 10.1109/PCCC.1990.101652 10.1109/32.245738 10.1109/32.67578 10.1145/62959.62964 10.1145/75308.75331 10.1109/ATS.1997.643968 10.1109/TSE.1985.232226 10.1109/32.241773 10.1145/99508.99551 10.1145/62959.62963 10.1109/32.310668 10.1109/TSE.1979.234213 10.1002/spe.4380160304 10.1145/99508.99553 10.1109/TSE.1984.5010257 10.1145/120807.120811 10.1109/TSE.1976.233819 10.1109/32.368137 10.1145/318789.318809 10.1109/32.126769 |
| ContentType | Journal Article |
| Copyright | Copyright © 2003 John Wiley & Sons, Ltd. |
| Copyright_xml | – notice: Copyright © 2003 John Wiley & Sons, Ltd. |
| DBID | BSCLL AAYXX CITATION |
| DOI | 10.1002/stvr.262 |
| DatabaseName | Istex CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1099-1689 |
| EndPage | 24 |
| ExternalDocumentID | 10_1002_stvr_262 STVR262 ark_67375_WNG_JDGR09F7_3 |
| Genre | article |
| GroupedDBID | .3N .4S .DC .GA .Y3 05W 0R~ 123 1L6 1OB 1OC 31~ 33P 3SF 3WU 4.4 50Y 50Z 52M 52O 52T 52U 52W 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHQN AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCUV ABIJN ABPVW ACAHQ ACBWZ ACCZN ACGFS ACIWK ACPOU ACRPL ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADMLS ADNMO ADOZA ADXAS ADZMN AEIGN AEIMD AEUYR AEYWJ AFBPY AFFPM AFGKR AFWVQ AFZJQ AGHNM AGQPQ AGYGG AHBTC AIQQE AITYG AIURR AJXKR ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ARCSS ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BSCLL CS3 CWDTD D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM EBS EDO EJD F00 F01 F04 F21 FEDTE G-S G.N GNP GODZA H.T H.X HF~ HGLYW HHY HVGLF HZ~ I-F IX1 JPC KQQ LATKE LAW LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES M61 MEWTI MK4 MK~ ML~ MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 NF~ NNB O66 O9- OIG P2P P2W P2X P4D PALCI PQQKQ Q.N QB0 QRW R.K RIWAO RJQFR ROL RX1 SAMSI SUPJJ TUS UB1 V2E W8V W99 WBKPD WIB WIH WIK WOHZO WXSBR WYISQ WZISG XPP XV2 ZZTAW ~IA ~WT AAHHS AAYOK ACCFJ AEEZP AEQDE AEUQT AFPWT AIWBW AJBDE RWI WWW AAYXX CITATION O8X |
| ID | FETCH-LOGICAL-c3012-b2b12ee7c6f4fb4d102931e9f6993178ca01088953a3a63ac64d62ca7b9f8a743 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 18 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000182377800002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0960-0833 |
| IngestDate | Sat Nov 29 05:28:52 EST 2025 Tue Nov 18 22:04:14 EST 2025 Wed Jan 22 16:39:15 EST 2025 Sun Sep 21 06:19:50 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | http://onlinelibrary.wiley.com/termsAndConditions#vor |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3012-b2b12ee7c6f4fb4d102931e9f6993178ca01088953a3a63ac64d62ca7b9f8a743 |
| Notes | istex:7915CC9D6F1F2D871CE7ADFF37D28B0AC0E63A29 ArticleID:STVR262 ark:/67375/WNG-JDGR09F7-3 |
| PageCount | 22 |
| ParticipantIDs | crossref_primary_10_1002_stvr_262 crossref_citationtrail_10_1002_stvr_262 wiley_primary_10_1002_stvr_262_STVR262 istex_primary_ark_67375_WNG_JDGR09F7_3 |
| PublicationCentury | 2000 |
| PublicationDate | January/March 2003 |
| PublicationDateYYYYMMDD | 2003-01-01 |
| PublicationDate_xml | – month: 01 year: 2003 text: January/March 2003 |
| PublicationDecade | 2000 |
| PublicationPlace | Chichester, UK |
| PublicationPlace_xml | – name: Chichester, UK |
| PublicationTitle | Software testing, verification & reliability |
| PublicationTitleAlternate | Softw. Test. Verif. Reliab |
| PublicationYear | 2003 |
| Publisher | John Wiley & Sons, Ltd |
| Publisher_xml | – name: John Wiley & Sons, Ltd |
| References | Ntafos SC, Hakimi SL. On path cover problems in digraphs and applications to program testing. IEEE Transactions on Software Engineering 1979; 5(5):520-529. Ostrand TJ, Balcer MJ. The category-partition method for specifying and generating functional tests. Communications of the ACM 1988; 31(6):676-686. Kleiman S, Shah D, Smaalders B. Programming with Threads. SunSoft Press, 1996. Taylor RN, Levine DL, Kelly CD. Structural testing of concurrent programs. IEEE Transactions on Software Engineering 1992; 18(3):206-215. Frankl PG, Weiss SN. An experimental comparison of the effectiveness of branch testing and data flow testing. IEEE Transactions on Software Engineering 1993; 19(8):774-787. Venkatesan S, Dathan B. Testing and debugging distributed programs using global predicates. IEEE Transactions on Software Engineering 1995; 21(2):163-177. Tai KC, Carver RH, Obaid EE. Debugging concurrent Ada programs by deterministic execution. IEEE Transactions on Software Engineering 1991; 17(1):45-63. Gait J. A probe effect in concurrent programs. Software-Practice and Experience 1986; 16(3):225-233. Weyuker EJ. The evaluation of program-based software test data adequacy criteria. Communications of the ACM 1988; 31(6):668-675. Frankl PG, Weyuker EJ. Provable improvements on branch testing. IEEE Transactions on Software Engineering 1993; 19(10):962-975. Bertolino A, Marrè M. Automatic generation of path covers based on the control flow analysis of computer programs. IEEE Transactions on Software Engineering 1994; 20(12):885-899. Gabow HN, Maheshwari SN, Osterweil LJ. On two problems in the generation of program test paths. IEEE Transactions on Software Engineering 1976; 2(3):227-231. Rapps S, Weyuker EJ. Selecting software test data using data flow information. IEEE Transactions on Software Engineering 1985; 11(4):367-375. Duran JW, Ntafos SC. An evaluation of random testing. IEEE Transactions on Software Engineering 1984; 10(4):438-444. Tantawy AN. High Performance Networks. Kluwer, 1994. Weyuker EJ. More experience with data flow testing. IEEE Transactions on Software Engineering 1993; 19(9):912-919. Cheung SC, Kramer J. Tractable dataflow analysis for distributed systems. IEEE Transactions on Software Engineering 1994; 20(8):579-593. Frankl PG, Weyuker EJ. A formal analysis of the fault-detecting ability of testing methods. IEEE Transactions on Software Engineering 1993; 19(3):202-213. 1993; 19 1991; 17 1990 1984; 10 1995; 21 1998 1986; 16 1976; 2 1992; 18 1979; 5 1997 1985 1996 1994 1993 1992 1988; 31 1991 1985; 11 1989 1994; 20 1999 Koppol PV (e_1_2_1_9_2) 1996 Tantawy AN (e_1_2_1_26_2) 1994 Grunwald D (e_1_2_1_16_2) 1993 e_1_2_1_22_2 e_1_2_1_23_2 e_1_2_1_20_2 e_1_2_1_21_2 Yang C‐SD (e_1_2_1_32_2) 1998 e_1_2_1_27_2 e_1_2_1_24_2 e_1_2_1_28_2 e_1_2_1_29_2 Girgis MR (e_1_2_1_2_2) 1985 e_1_2_1_6_2 e_1_2_1_30_2 e_1_2_1_7_2 e_1_2_1_4_2 e_1_2_1_5_2 Netzer RHB (e_1_2_1_13_2) 1992 e_1_2_1_11_2 e_1_2_1_3_2 e_1_2_1_12_2 Kleiman S (e_1_2_1_25_2) 1996 e_1_2_1_33_2 e_1_2_1_10_2 e_1_2_1_31_2 e_1_2_1_15_2 e_1_2_1_14_2 e_1_2_1_19_2 e_1_2_1_8_2 e_1_2_1_17_2 e_1_2_1_18_2 |
| References_xml | – reference: Gait J. A probe effect in concurrent programs. Software-Practice and Experience 1986; 16(3):225-233. – reference: Kleiman S, Shah D, Smaalders B. Programming with Threads. SunSoft Press, 1996. – reference: Gabow HN, Maheshwari SN, Osterweil LJ. On two problems in the generation of program test paths. IEEE Transactions on Software Engineering 1976; 2(3):227-231. – reference: Bertolino A, Marrè M. Automatic generation of path covers based on the control flow analysis of computer programs. IEEE Transactions on Software Engineering 1994; 20(12):885-899. – reference: Taylor RN, Levine DL, Kelly CD. Structural testing of concurrent programs. IEEE Transactions on Software Engineering 1992; 18(3):206-215. – reference: Ostrand TJ, Balcer MJ. The category-partition method for specifying and generating functional tests. Communications of the ACM 1988; 31(6):676-686. – reference: Tai KC, Carver RH, Obaid EE. Debugging concurrent Ada programs by deterministic execution. IEEE Transactions on Software Engineering 1991; 17(1):45-63. – reference: Tantawy AN. High Performance Networks. Kluwer, 1994. – reference: Weyuker EJ. More experience with data flow testing. IEEE Transactions on Software Engineering 1993; 19(9):912-919. – reference: Cheung SC, Kramer J. Tractable dataflow analysis for distributed systems. IEEE Transactions on Software Engineering 1994; 20(8):579-593. – reference: Frankl PG, Weyuker EJ. A formal analysis of the fault-detecting ability of testing methods. IEEE Transactions on Software Engineering 1993; 19(3):202-213. – reference: Weyuker EJ. The evaluation of program-based software test data adequacy criteria. Communications of the ACM 1988; 31(6):668-675. – reference: Frankl PG, Weiss SN. An experimental comparison of the effectiveness of branch testing and data flow testing. IEEE Transactions on Software Engineering 1993; 19(8):774-787. – reference: Venkatesan S, Dathan B. Testing and debugging distributed programs using global predicates. IEEE Transactions on Software Engineering 1995; 21(2):163-177. – reference: Rapps S, Weyuker EJ. Selecting software test data using data flow information. IEEE Transactions on Software Engineering 1985; 11(4):367-375. – reference: Ntafos SC, Hakimi SL. On path cover problems in digraphs and applications to program testing. IEEE Transactions on Software Engineering 1979; 5(5):520-529. – reference: Duran JW, Ntafos SC. An evaluation of random testing. IEEE Transactions on Software Engineering 1984; 10(4):438-444. – reference: Frankl PG, Weyuker EJ. Provable improvements on branch testing. IEEE Transactions on Software Engineering 1993; 19(10):962-975. – volume: 20 start-page: 579 issue: 8 year: 1994 end-page: 593 article-title: Tractable dataflow analysis for distributed systems publication-title: IEEE Transactions on Software Engineering – volume: 5 start-page: 520 issue: 5 year: 1979 end-page: 529 article-title: On path cover problems in digraphs and applications to program testing publication-title: IEEE Transactions on Software Engineering – start-page: 313 year: 1985 end-page: 319 – volume: 20 start-page: 885 issue: 12 year: 1994 end-page: 899 article-title: Automatic generation of path covers based on the control flow analysis of computer programs publication-title: IEEE Transactions on Software Engineering – volume: 18 start-page: 206 issue: 3 year: 1992 end-page: 215 article-title: Structural testing of concurrent programs publication-title: IEEE Transactions on Software Engineering – volume: 11 start-page: 367 issue: 4 year: 1985 end-page: 375 article-title: Selecting software test data using data flow information publication-title: IEEE Transactions on Software Engineering – start-page: 36 year: 1991 end-page: 48 – start-page: 425 year: 1990 end-page: 432 – start-page: 200 year: 1989 end-page: 209 – volume: 17 start-page: 45 issue: 1 year: 1991 end-page: 63 article-title: Debugging concurrent Ada programs by deterministic execution publication-title: IEEE Transactions on Software Engineering – volume: 19 start-page: 774 issue: 8 year: 1993 end-page: 787 article-title: An experimental comparison of the effectiveness of branch testing and data flow testing publication-title: IEEE Transactions on Software Engineering – volume: 16 start-page: 225 issue: 3 year: 1986 end-page: 233 article-title: A probe effect in concurrent programs publication-title: Software—Practice and Experience – volume: 31 start-page: 668 issue: 6 year: 1988 end-page: 675 article-title: The evaluation of program‐based software test data adequacy criteria publication-title: Communications of the ACM – year: 1996 – start-page: 153 year: 1998 end-page: 162 – volume: 31 start-page: 676 issue: 6 year: 1988 end-page: 686 article-title: The category‐partition method for specifying and generating functional tests publication-title: Communications of the ACM – start-page: 200 year: 1990 end-page: 208 – year: 1994 – volume: 19 start-page: 202 issue: 3 year: 1993 end-page: 213 article-title: A formal analysis of the fault‐detecting ability of testing methods publication-title: IEEE Transactions on Software Engineering – year: 1998 – volume: 19 start-page: 912 issue: 9 year: 1993 end-page: 919 article-title: More experience with data flow testing publication-title: IEEE Transactions on Software Engineering – start-page: 263 year: 1997 end-page: 268 – start-page: 175 year: 1989 end-page: 185 – volume: 10 start-page: 438 issue: 4 year: 1984 end-page: 444 article-title: An evaluation of random testing publication-title: IEEE Transactions on Software Engineering – volume: 21 start-page: 163 issue: 2 year: 1995 end-page: 177 article-title: Testing and debugging distributed programs using global predicates publication-title: IEEE Transactions on Software Engineering – volume: 2 start-page: 227 issue: 3 year: 1976 end-page: 231 article-title: On two problems in the generation of program test paths publication-title: IEEE Transactions on Software Engineering – start-page: 502 year: 1992 end-page: 511 – start-page: 14 year: 1996 end-page: 23 – start-page: 502 year: 1993 end-page: 616 – start-page: 188 year: 1990 end-page: 199 – volume: 19 start-page: 962 issue: 10 year: 1993 end-page: 975 article-title: Provable improvements on branch testing publication-title: IEEE Transactions on Software Engineering – year: 1999 – ident: e_1_2_1_23_2 doi: 10.1109/32.221133 – ident: e_1_2_1_14_2 – start-page: 502 volume-title: Languages and Compilers for Parallel Computing year: 1993 ident: e_1_2_1_16_2 – start-page: 14 volume-title: Proceedings of the International Symposium on Software Testing and Analysis year: 1996 ident: e_1_2_1_9_2 – ident: e_1_2_1_6_2 doi: 10.1109/32.345831 – start-page: 502 volume-title: Supercomputing year: 1992 ident: e_1_2_1_13_2 – ident: e_1_2_1_19_2 doi: 10.1109/32.238581 – ident: e_1_2_1_33_2 doi: 10.1109/PCCC.1990.101652 – ident: e_1_2_1_22_2 doi: 10.1109/32.245738 – ident: e_1_2_1_17_2 doi: 10.1109/32.67578 – ident: e_1_2_1_3_2 doi: 10.1145/62959.62964 – ident: e_1_2_1_7_2 doi: 10.1145/75308.75331 – ident: e_1_2_1_31_2 doi: 10.1109/ATS.1997.643968 – ident: e_1_2_1_15_2 doi: 10.1109/TSE.1985.232226 – ident: e_1_2_1_20_2 doi: 10.1109/32.241773 – start-page: 153 volume-title: Proceedings of the International Symposium on Software Testing and Analysis year: 1998 ident: e_1_2_1_32_2 – ident: e_1_2_1_28_2 doi: 10.1145/99508.99551 – start-page: 313 volume-title: Proceedings 8th International Conference on Software Engineering year: 1985 ident: e_1_2_1_2_2 – ident: e_1_2_1_10_2 – volume-title: High Performance Networks year: 1994 ident: e_1_2_1_26_2 – ident: e_1_2_1_18_2 doi: 10.1145/62959.62963 – ident: e_1_2_1_5_2 doi: 10.1109/32.310668 – ident: e_1_2_1_30_2 doi: 10.1109/TSE.1979.234213 – ident: e_1_2_1_24_2 doi: 10.1002/spe.4380160304 – ident: e_1_2_1_27_2 doi: 10.1145/99508.99553 – ident: e_1_2_1_21_2 doi: 10.1109/TSE.1984.5010257 – ident: e_1_2_1_11_2 doi: 10.1145/120807.120811 – ident: e_1_2_1_29_2 doi: 10.1109/TSE.1976.233819 – ident: e_1_2_1_4_2 doi: 10.1109/32.368137 – ident: e_1_2_1_12_2 doi: 10.1145/318789.318809 – volume-title: Programming with Threads year: 1996 ident: e_1_2_1_25_2 – ident: e_1_2_1_8_2 doi: 10.1109/32.126769 |
| SSID | ssj0006969 |
| Score | 1.6742907 |
| Snippet | Parallelism has become a way of life for many scientific programmers. A significant challenge in bringing the power of parallel machines to these programmers... |
| SourceID | crossref wiley istex |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 3 |
| SubjectTerms | all-uses testing shared memory parallel programming structural software testing |
| Title | All-uses testing of shared memory parallel programs |
| URI | https://api.istex.fr/ark:/67375/WNG-JDGR09F7-3/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fstvr.262 |
| Volume | 13 |
| WOSCitedRecordID | wos000182377800002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1099-1689 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006969 issn: 0960-0833 databaseCode: DRFUL dateStart: 19960101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1dS8MwFA3ifPDF-YnziwiiT3Vr0ibN43B2ImPI3ObeSpKmKtZO1m3omz_B3-gvMWm7yUBB8Kkvp6Xcm3tzbzg5F4ATFoZRaCts2doFluPWsCUQkpZLscSKCMoz4fl-i7bb3mDAbgpWpbkLk-tDzA_cTGRk-doEOBdp9Vs0NB1PR-fIpN-SuVOlG69So-P3WvM8TBjJlfaIYWxhPJOeraHq7N2Fzahk7Pq6WKRmu4xf_s__rYO1oraE9XwxbIAllWyC8mxuAyzCeAu49Tj-fP-YpCqFY6OykdzDYQTTB0NGh8-Ge_sGjSZ4HKsYFgyudBv0_MvuxZVVjE-wpI5apG0ubKQUlSRyIuGEupRg2FYsIromsaknue7FPI-5mGNOMJfECQmSnAoWeVxXFjtgORkmahdARpkIkWtgoUMcW3BGERG6-wpxpDyvAs5mdgxkoS1uRlzEQa6KjAJjjUBbowKO58iXXE_jB8xp5oo5gI-eDP-MusFduxlcN5qdGvNpgDUw88CvXwpuu_2Ofu79FbgPVjO2XnbGcgCWx6OJOgQrcjp-TEdHxQr7Ai7K1kU |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB5kV9CLb_FtBNFTdZu0SYMnUdfXusi6Pm4hTVMV6yrbVfTmT_A3-ktM-lgRFARPvXwtZSYzmQxfvgFY5VEUR64mjmtc4Hh-jTghxsrxGVFE05DJTHj-osGazeDqip8OwFZ5FybXh-g33GxkZPnaBrhtSG9-qYamvefuBrb5t-pRwoIKVHdb9fNGPxFTTnOpPWopW4SU2rM1vFm--203qlrDvnyvUrNtpj76rx8cg5GiukTb-XIYhwHdmYDRcnIDKgJ5EvztJPl4e39KdYp6Vmejc40eYpTeWDo6urfs21dkVcGTRCeo4HClU3Be32vvHDjFAAVHmbjFxuqhi7VmisZeHHqRKSY4cTWPqalKXBYoaU5jQcB9IomkRCrqRRQryUIeB9LUFtNQ6Tx09AwgzngYYd_CIo96big5wzQ056-IxDoIZmG9NKRQhbq4HXKRiFwXGQtrDWGsMQsrfeRjrqjxA2Yt80UfILt3loHGfHHZ3BdHu_utGq8zQQwwc8GvXxJn7YuWec79FbgMQwftk4ZoHDaP52E44-5lHZcFqPS6T3oRBtVz7zbtLhXL7RMEsto1 |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1NTxsxEB2hpEJcgBYqwleNhOC0kLV37bV6QqRLS6MIBQi5WV7bC4gloGxA9MZP4Df2l9Tej1RIRarEyZfn1WrGMx5bz28AtrnWqfYN8XzrAi8I28RLMFZeyIgihiZMFsLzgy7r9aLhkJ_MwNf6LUypDzG9cHORUeRrF-DmXqf7f1VD88njeA-7_NsMQh4GDWh2-vF5d5qIKael1B51lC1Cau3ZNt6v577ajZrOsE-vq9Rim4kX3vWDizBfVZfooFwOH2HGjD7BQt25AVWBvAThQZb9fn55yE2OJk5nY3SJ7lKUXzk6Orp17NtfyKmCZ5nJUMXhypfhPP52dvjdqxooeMrGLbZWT3xsDFM0DdIk0LaY4MQ3PKW2KvFZpKQ9jUURD4kkkhKpaKApVpIlPI2krS0-Q2N0NzIrgDjjicahg-mABn4iOcM0secvTVITRS3YrQ0pVKUu7ppcZKLURcbCWUNYa7Rga4q8LxU1_oHZKXwxBcjxjWOgsVBc9I7Eceeo3-YxE8QCCxe8-SVxejbo23H1f4FfYPakE4vuj97PNZgrqHvFhcs6NCbjB7MBH9Tj5Dofb1ar7Q_IL9mw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=All%E2%80%90uses+testing+of+shared+memory+parallel+programs&rft.jtitle=Software+testing%2C+verification+%26+reliability&rft.au=Yang%2C+Cheer%E2%80%90Sun+D.&rft.au=Pollock%2C+Lori+L.&rft.date=2003-01-01&rft.issn=0960-0833&rft.eissn=1099-1689&rft.volume=13&rft.issue=1&rft.spage=3&rft.epage=24&rft_id=info:doi/10.1002%2Fstvr.262&rft.externalDBID=n%2Fa&rft.externalDocID=10_1002_stvr_262 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0960-0833&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0960-0833&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0960-0833&client=summon |