Automated test sequence generation using sequencing constraints for concurrent programs

B. Karaçali, K. Tai
{"title":"Automated test sequence generation using sequencing constraints for concurrent programs","authors":"B. Karaçali, K. Tai","doi":"10.1109/PDSE.1999.779742","DOIUrl":null,"url":null,"abstract":"Sequencing constraints for a concurrent program specify restrictions on the allowed sequences of synchronization events, and they can be used in generating test sequences for the program. In earlier work, the notion of CSPE (constraints on succeeding and preceding events) constraint was defined, and the CSPE-1 coverage criterion, which requires the coverage of each CSPE constraint at least once, was shown to be effective for fault detection. We show how to automatically generate test sequences to satisfy, the CSPE-1 criterion for a set of CSPE constraints. Our test sequence generation strategy is to determine (a) the number of instances for each process type for accomplishing the CSPE-1 coverage criterion such that the total instance number is minimum and (b) the smallest sequence set among all sets satisfying (a). Empirical results of applying our test generation strategy to the bounded buffer problem and seven versions of the readers and writers problem are presented.","PeriodicalId":373753,"journal":{"name":"1999 Proceedings International Symposium on Software Engineering for Parallel and Distributed Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 Proceedings International Symposium on Software Engineering for Parallel and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDSE.1999.779742","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

Sequencing constraints for a concurrent program specify restrictions on the allowed sequences of synchronization events, and they can be used in generating test sequences for the program. In earlier work, the notion of CSPE (constraints on succeeding and preceding events) constraint was defined, and the CSPE-1 coverage criterion, which requires the coverage of each CSPE constraint at least once, was shown to be effective for fault detection. We show how to automatically generate test sequences to satisfy, the CSPE-1 criterion for a set of CSPE constraints. Our test sequence generation strategy is to determine (a) the number of instances for each process type for accomplishing the CSPE-1 coverage criterion such that the total instance number is minimum and (b) the smallest sequence set among all sets satisfying (a). Empirical results of applying our test generation strategy to the bounded buffer problem and seven versions of the readers and writers problem are presented.
使用并行程序的序列约束自动生成测试序列
并发程序的序列约束指定了对允许的同步事件序列的限制,并且它们可以用于为程序生成测试序列。在早期的工作中,定义了CSPE(后续和先前事件的约束)约束的概念,并且CSPE-1覆盖标准被证明对故障检测是有效的,该标准要求每个CSPE约束至少覆盖一次。我们展示了如何自动生成测试序列来满足一组CSPE约束的CSPE-1标准。我们的测试序列生成策略是确定(a)完成CSPE-1覆盖标准的每种进程类型的实例数,使总实例数最小,以及(b)满足(a)的所有集合中最小的序列集。将我们的测试生成策略应用于有界缓冲区问题和七个版本的阅读器和写入器问题的经验结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信