不确定并发程序的语句覆盖测试

2012 Sixth International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2012-07-04 DOI:10.1109/TASE.2012.21

Gwan-Hwan Hwang, Heng-Yi Lin, Shao-Yan Lin, Che-Sheng Lin

{"title":"不确定并发程序的语句覆盖测试","authors":"Gwan-Hwan Hwang, Heng-Yi Lin, Shao-Yan Lin, Che-Sheng Lin","doi":"10.1109/TASE.2012.21","DOIUrl":null,"url":null,"abstract":"In this paper we propose a scheme for reachability testing to obtain statement coverage in the dynamic testing of concurrent programs. The proposed scheme derives inputs from SYN-sequences obtained in reachability testing and uses these inputs to perform reachability testing multiple times in order to achieve statement-coverage testing for a concurrent program.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Statement-Coverage Testing for Nondeterministic Concurrent Programs\",\"authors\":\"Gwan-Hwan Hwang, Heng-Yi Lin, Shao-Yan Lin, Che-Sheng Lin\",\"doi\":\"10.1109/TASE.2012.21\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose a scheme for reachability testing to obtain statement coverage in the dynamic testing of concurrent programs. The proposed scheme derives inputs from SYN-sequences obtained in reachability testing and uses these inputs to perform reachability testing multiple times in order to achieve statement-coverage testing for a concurrent program.\",\"PeriodicalId\":417979,\"journal\":{\"name\":\"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TASE.2012.21\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TASE.2012.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

本文提出了一种在并发程序动态测试中获取语句覆盖率的可达性测试方案。该方案从可达性测试中获得的syn序列中提取输入，并使用这些输入进行多次可达性测试，以实现对并发程序的语句覆盖测试。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Statement-Coverage Testing for Nondeterministic Concurrent Programs

In this paper we propose a scheme for reachability testing to obtain statement coverage in the dynamic testing of concurrent programs. The proposed scheme derives inputs from SYN-sequences obtained in reachability testing and uses these inputs to perform reachability testing multiple times in order to achieve statement-coverage testing for a concurrent program.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 Sixth International Symposium on Theoretical Aspects of Software Engineering

自引率

0.00%

发文量