Reachability testing: An approach to testing concurrent software
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
510 | en_US |
dc.citation.issue |
4 | en_US |
dc.citation.spage |
493 | en_US |
dc.citation.volume |
5 | en_US |
dc.contributor.author |
Hwang, GH | en_US |
dc.contributor.author |
Tai, KC | en_US |
dc.contributor.author |
Huang, TL | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:03:01Z | |
dc.date.available |
2014-12-08T15:03:01Z | |
dc.date.issued |
1995-12-01 | en_US |
dc.description.abstract |
Concurrent programs are more difficult to test than sequential programs because of nondeterministic behavior. An execution of a concurrent program non-deterministically exercises a sequence of synchronization events called a synchronization sequence (or SYN-sequence). Non-deterministic testing of a concurrent program P is to execute P with a given input many times in order to exercise distinct SYN-sequences. In this paper, we present a new testing approach called reachability testing. If every execution of P with input X terminates, reachability testing of P with input X derives and executes all possible SYN-sequences of P with input X. We show how to perform reachability testing of concurrent programs using read and write operations. Also, we present results of empirical studies comparing reachability and non-deterministic testing. Our results indicate that reachability testing has advantages over non-deterministic testing. | en_US |
dc.identifier.doi |
10.1142/S0218194095000241 | en_US |
dc.identifier.issn |
0218-1940 | en_US |
dc.identifier.journal |
INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1142/S0218194095000241 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/1609 | |
dc.identifier.wosnumber |
WOS:A1995TR23300001 | |
dc.language.iso |
en_US | en_US |
dc.subject |
concurrent programs | en_US |
dc.subject |
software testing | en_US |
dc.subject |
non-deterministic testing | en_US |
dc.subject |
deterministic testing | en_US |
dc.subject |
reachability testing | en_US |
dc.title |
Reachability testing: An approach to testing concurrent software | en_US |
dc.type |
Article; Proceedings Paper | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 會議論文
引用此條目
Hwang, G., Tai, K., & Huang, T. (1995). Reachability testing: An approach to testing concurrent software. INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING, 5(4), 493–510. https://doi.org/10.1142/S0218194095000241
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/1609