Challenges of Specification Mining-Based Test Oracle for Cyber-Physical Systems

M. Aliabadi, H. Haghighi, M. V. Asl, R. Meybodi
{"title":"Challenges of Specification Mining-Based Test Oracle for Cyber-Physical Systems","authors":"M. Aliabadi, H. Haghighi, M. V. Asl, R. Meybodi","doi":"10.1109/IKT51791.2020.9345615","DOIUrl":null,"url":null,"abstract":"Test oracle problem is considered as a major challenge in software testing. Specification mining techniques are shown to be effective to tackle test oracle problem in software systems. In addition, modern systems such as Cyber-Physical Systems (CPSes) have special constraints that should be satisfied when deriving the test oracles for these systems. However, comparing different specification mining techniques for CPS applications is challenging, because no common ground to assess the effectiveness of such techniques has been established yet. In this survey, our contribution is two folded: First, we analyze the CPS constraints from the test oracle point of view, and present a framework of requirements representing six essential criteria for evaluating to which extent specification miners satisfy CPS constraints. Secondly, we review the literature for the specification mining techniques, and use our framework to compare the effectiveness of various static and dynamic analysis-based specification mining techniques, and to discuss their respective advantages and disadvantages,","PeriodicalId":382725,"journal":{"name":"2020 11th International Conference on Information and Knowledge Technology (IKT)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 11th International Conference on Information and Knowledge Technology (IKT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IKT51791.2020.9345615","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Test oracle problem is considered as a major challenge in software testing. Specification mining techniques are shown to be effective to tackle test oracle problem in software systems. In addition, modern systems such as Cyber-Physical Systems (CPSes) have special constraints that should be satisfied when deriving the test oracles for these systems. However, comparing different specification mining techniques for CPS applications is challenging, because no common ground to assess the effectiveness of such techniques has been established yet. In this survey, our contribution is two folded: First, we analyze the CPS constraints from the test oracle point of view, and present a framework of requirements representing six essential criteria for evaluating to which extent specification miners satisfy CPS constraints. Secondly, we review the literature for the specification mining techniques, and use our framework to compare the effectiveness of various static and dynamic analysis-based specification mining techniques, and to discuss their respective advantages and disadvantages,
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于规范挖掘的网络物理系统测试Oracle的挑战
测试oracle问题被认为是软件测试中的一个主要挑战。规范挖掘技术是解决软件系统中测试oracle问题的有效方法。此外,现代系统,如信息物理系统(Cyber-Physical systems, CPSes),在为这些系统导出测试预言机时,需要满足特殊的约束条件。然而,比较用于CPS应用程序的不同规范挖掘技术是具有挑战性的,因为尚未建立评估此类技术有效性的共同基础。在这项调查中,我们的贡献有两个方面:首先,我们从测试oracle的角度分析了CPS约束,并提出了一个需求框架,该框架代表了六个基本标准,用于评估规范挖掘器在多大程度上满足CPS约束。其次,我们回顾了规范挖掘技术的文献,并使用我们的框架比较了各种基于静态和动态分析的规范挖掘技术的有效性,并讨论了它们各自的优缺点;
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A New Sentence Ordering Method using BERT Pretrained Model Classical-Quantum Multiple Access Wiretap Channel with Common Message: One-Shot Rate Region Business Process Improvement Challenges: A Systematic Literature Review The risk prediction of heart disease by using neuro-fuzzy and improved GOA Distributed Learning Automata-Based Algorithm for Finding K-Clique in Complex Social Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1