Reachability testing: An approach to testing concurrent software
檔案
本條目沒有附加檔案。
日期
1995-12-01
系所
期刊名稱
INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING
卷期與頁次
第 5 卷第 4 期,頁 493–510
ISSN
0218-1940
語言
英文
摘要
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.
關鍵詞
concurrent programssoftware testingnon-deterministic testingdeterministic testingreachability testing所屬典藏
會議論文引用此條目
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