Branch testing of concurrent programs using Petri net models

Hong Fa Ho*, Gen Heuy Chen, Te Son Kuo

*此作品的通信作者

研究成果: 雜誌貢獻期刊論文同行評審

1 引文 斯高帕斯(Scopus)

摘要

Most methods for testing sequential programs are useless in testing concurrent programs, owing to the existence of multiple execution flows in concurrent programs. In the paper, a systematic branch testing method for concurrent programs is proposed. Paths generated by the proposed method can be sensitized to obtain the necessary test data. In particular, the proposed method possesses generality, and is capable of detecting all dead codes and deadlocks due to incorrect program design. For evaluating different tests, two new coverage measures used for estimating the quality of testing concurrent programs are proposed. It is shown here that to find optimal paths for branch testing of concurrent programs is NP-hard. The path selection problem with budget limitation is also discussed. Experimental results provide support for the proposed method.

原文英語
頁(從 - 到)116-125
頁數10
期刊Computer Systems Science and Engineering
5
發行號2
出版狀態已發佈 - 1990 四月 1

ASJC Scopus subject areas

  • 控制與系統工程
  • 理論電腦科學
  • 電腦科學(全部)

指紋

深入研究「Branch testing of concurrent programs using Petri net models」主題。共同形成了獨特的指紋。

引用此