发布求助
文献互助 智能选刊 最新文献

2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS)最新文献

筛选
英文 中文
What are Good Discussions Within Bug Report Comments for Shortening Bug Fixing Time? 如何在Bug报告注释中进行讨论以缩短Bug修复时间?
2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2019-07-22 DOI: 10.1109/QRS.2019.00044
Yuki Noyori, H. Washizaki, Y. Fukazawa, Keishi Oshima, Hideyuki Kanuka, Shuhei Nojiri, Ryosuke Tsuchiya
{"title":"What are Good Discussions Within Bug Report Comments for Shortening Bug Fixing Time?","authors":"Yuki Noyori, H. Washizaki, Y. Fukazawa, Keishi Oshima, Hideyuki Kanuka, Shuhei Nojiri, Ryosuke Tsuchiya","doi":"10.1109/QRS.2019.00044","DOIUrl":"https://doi.org/10.1109/QRS.2019.00044","url":null,"abstract":"Bugs must be resolved efficiently for developers' limited resources. Bug reports are necessary for the bug modification process. Service user reports a bug as a bug report. Developer read bug reports and fix bugs. The developer can make discussion by posting comments on reported bug reports. There are several researches on the initial report of the bug report so that bugs can be fixed efficiently. But there are few researches on bug report comments. We focus on comments on bug reports. Currently, everyone is free to comment, but the modification time may be affected by how to comment. We investigate the topic of comments of the bug report. As a result of the investigation, the fact that the topics are mixed does not affect the modification time, however we found a tendency to shorten the modification time when the topic of the solution started early.","PeriodicalId":122665,"journal":{"name":"2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116716208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Hybrid Predicate Transition Nets - A Formal Method for Modeling and Analyzing Cyber-Physical Systems 混合谓词转换网-一种建模和分析网络物理系统的形式化方法
2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2019-07-22 DOI: 10.1109/QRS.2019.00038
Xudong He, Dewan Mohammad Moksedul Alam
{"title":"Hybrid Predicate Transition Nets - A Formal Method for Modeling and Analyzing Cyber-Physical Systems","authors":"Xudong He, Dewan Mohammad Moksedul Alam","doi":"10.1109/QRS.2019.00038","DOIUrl":"https://doi.org/10.1109/QRS.2019.00038","url":null,"abstract":"Cyber-physical systems are complex systems with hybrid behaviors. In this paper, hybrid predicate transition nets (HPrTNs) are proposed for modeling and analyzing cyberphysical systems. HPrTNs are formally defined and their relationships to hybrid automata are shown. Important features of HPrTNs including continuous places, differential equations for defining token evolution, and net composition are discussed. The applicability of HPrTNs is demonstrated through several wellknown benchmark hybrid systems.","PeriodicalId":122665,"journal":{"name":"2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134103835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Efficient Generation of Test Data with Extended Cardinality Constraints 扩展基数约束下测试数据的高效生成
2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2019-07-22 DOI: 10.1109/QRS.2019.00055
M. Larouche, Sylvain Hallé
{"title":"Efficient Generation of Test Data with Extended Cardinality Constraints","authors":"M. Larouche, Sylvain Hallé","doi":"10.1109/QRS.2019.00055","DOIUrl":"https://doi.org/10.1109/QRS.2019.00055","url":null,"abstract":"We present an extension of first-order logic that includes a counting quantifier, allowing one to express assertions about the number n of elements in a set that satisfy a given property. We show how this logic can be used to express problems such as node degree distribution in computer networks, various graph problems and entity relationships with cardinality constraints found in UML diagrams. We then present a translation of this counting logic back into classical first-order logic; this translation is linear in the number of quantifiers and independent of n. This translation makes it possible to use existing first-order model finders to efficiently generate test data following a specific distribution.","PeriodicalId":122665,"journal":{"name":"2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128236761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Transfer Learning Based Interpretable User Experience Model on Small Samples 基于迁移学习的小样本可解释用户体验模型
2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2019-07-22 DOI: 10.1109/QRS.2019.00035
Qi Yu, Xiaoping Che, Yuxiang Yang, Liqiang Wang
{"title":"A Transfer Learning Based Interpretable User Experience Model on Small Samples","authors":"Qi Yu, Xiaoping Che, Yuxiang Yang, Liqiang Wang","doi":"10.1109/QRS.2019.00035","DOIUrl":"https://doi.org/10.1109/QRS.2019.00035","url":null,"abstract":"User experience (UX) is a key factor that affects software survival time. A rich line of research has studied the relationships between UX and software factors to modify software and improve user satisfaction. However, the existing machine learning models for predicting UX on small data set is not accurate enough, and research with traditional statistical methods only obtained indistinct relations among UX, user characteristics and software factors. With the goal of improving the accuracy of UX model and obtaining sufficient UX relationships, we propose Transfer in Cart (TrCart) algorithm and Transfer Adaboost in Cart (TrAdaBoostCart) algorithm. To verify this approach, we present the UX study on a desktop game and an android game. According to the experimental results, we find that the TrAdaBoostCart has better accuracy and interpretable results. Hence, the proposed approach provides important guidelines for the design process of mobile applications.","PeriodicalId":122665,"journal":{"name":"2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132620457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Distance-Based Dynamic Random Testing with Test Case Clustering 基于距离的测试用例聚类动态随机测试
2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2019-07-22 DOI: 10.1109/QRS.2019.00019
Hanyu Pei, Beibei Yin, K. Cai, M. Xie
{"title":"A Distance-Based Dynamic Random Testing with Test Case Clustering","authors":"Hanyu Pei, Beibei Yin, K. Cai, M. Xie","doi":"10.1109/QRS.2019.00019","DOIUrl":"https://doi.org/10.1109/QRS.2019.00019","url":null,"abstract":"One goal of software testing strategies is to detect faults faster. Dynamic Random Testing (DRT) strategy uses the testing results to guide the selection of test cases, which have shown to be effective in the fault detection process. However, the effectiveness of DRT still can be improved. In this paper, a distance-based DRT (D-DRT) strategy is proposed. The vectorized test cases are partitioned with k-means clustering method to obtain better classification, and the distance information are used to guide the test case selection, then the test cases that are close to failure-causing test cases are more likely to be selected, thus the testing process can be optimized. In the case study, the performance of D-DRT and other testing strategies are compared. The experiment results show that the proposed D-DRT strategy has better fault detection effectiveness than the others without significant increase in computational cost.","PeriodicalId":122665,"journal":{"name":"2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125946297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Combinatorial Robustness Testing with Negative Test Cases 负测试用例的组合鲁棒性测试
2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2019-07-22 DOI: 10.1109/QRS.2019.00018
Konrad Fögen, H. Lichter
{"title":"Combinatorial Robustness Testing with Negative Test Cases","authors":"Konrad Fögen, H. Lichter","doi":"10.1109/QRS.2019.00018","DOIUrl":"https://doi.org/10.1109/QRS.2019.00018","url":null,"abstract":"Error-handling is an important means to improve the robustness of a system and testing error-handling is crucial to ensure its correctness. In this paper, we argue that error-handling leads to input masking which requires special treatment in for combinatorial testing. Therefore, we propose an extension to combinatorial testing including a robustness fault model and robustness combination strategy. We also provide an evaluation which compares its efficiency to normal combinatorial testing.","PeriodicalId":122665,"journal":{"name":"2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123708102","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Testing Scientific Software with Invariant Relations: A Case Study 用不变关系测试科学软件:一个案例研究
2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2019-07-22 DOI: 10.1109/QRS.2019.00057
Junhua Ding, Xinchuan Li, Xin-Hua Hu
{"title":"Testing Scientific Software with Invariant Relations: A Case Study","authors":"Junhua Ding, Xinchuan Li, Xin-Hua Hu","doi":"10.1109/QRS.2019.00057","DOIUrl":"https://doi.org/10.1109/QRS.2019.00057","url":null,"abstract":"Adequately testing scientific software is essential to the quality of the software. However, it is a grand challenge due to the oracle problem. Metamorphic testing has shown its effectiveness for alleviating the problem. But the effectiveness of metamorphic testing is highly dependent on the quality of metamorphic relations that are developed for testing the software. In this paper, we propose a framework for iteratively developing metamorphic relations for adequately testing scientific software. The basic idea is to refine metamorphic relations that are loosely defined to those that can be verified with only limited number of cases so that the relations can be accurately tested. We explain the framework through testing a scientific software system that is used for modeling light scattering of particles. Based on domain knowledge and general guidelines, a group of metamorphic relations are first identified and tested. According to testing results, the metamorphic relations are refined step by step until each of them can be accurately tested. In particular, an invariant transform is applied to the metamorphic relations for significantly reducing the number of cases that can satisfy the relations. Finally the relations are further transformed with a carefully defined hash function to ensure each of the metamorphic relations can be automatically verified. The proposed approach truly solves the oracle problem and greatly improves the effectiveness of metamorphic testing. Its effectiveness is evaluated by mutation testing and demonstrated by new problems found in the software.","PeriodicalId":122665,"journal":{"name":"2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133135630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
On Kolmogorov-Smirnov Test for Software Reliability Models with Grouped Data 分组数据下软件可靠性模型的Kolmogorov-Smirnov检验
2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2019-07-22 DOI: 10.1109/QRS.2019.00023
H. Okamura, T. Dohi
{"title":"On Kolmogorov-Smirnov Test for Software Reliability Models with Grouped Data","authors":"H. Okamura, T. Dohi","doi":"10.1109/QRS.2019.00023","DOIUrl":"https://doi.org/10.1109/QRS.2019.00023","url":null,"abstract":"Software reliability models (SRMs) are the stochastic processes of the number of faults detected in the development phase, and are utilized to estimate the quantitative reliability measures of software. In the reliability evaluation with SRM, after estimating model parameters from the observed the number of detected faults, we should test the estimated SRM is fitted to the observed data statistically, i.e., we perform the goodness-of-fit test for the estimated SRM. In the past literature, Kolmogorov-Smirnov (KS) test has been used as the goodness-of-fit test for SRM. In this paper, we revisit the KS test for SRM in the case where the model parameters of SRM are estimated from grouped data of the number of detected faults.","PeriodicalId":122665,"journal":{"name":"2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126368920","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Random Border Mirror Transform: A Diversity Based Approach to an Effective and Efficient Mirror Adaptive Random Testing 随机边界镜像变换:一种基于分集的镜像自适应随机测试方法
2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2019-07-22 DOI: 10.1109/QRS.2019.00020
Michael Omari, Jinfu Chen, P. Kudjo, Hilary Ackah-Arthur, Rubing Huang
{"title":"Random Border Mirror Transform: A Diversity Based Approach to an Effective and Efficient Mirror Adaptive Random Testing","authors":"Michael Omari, Jinfu Chen, P. Kudjo, Hilary Ackah-Arthur, Rubing Huang","doi":"10.1109/QRS.2019.00020","DOIUrl":"https://doi.org/10.1109/QRS.2019.00020","url":null,"abstract":"Mirror Adaptive random testing (MART) is an overhead reduction strategy for adaptive random testing methods. Theoretically speaking, MART's advantage over ordinary ARTs is determined by the mirroring scheme selected. Incidentally, an inherent problem with MART relates to the difficulty in the choice of a scheme for any testing task. This is because a higher scheme (larger mirror domains) does not necessarily guarantee efficient utilization of testing resources due to lack of diversity of mirror generated test cases. The culprit has been identified as the mapping functions used as substitutes to complex ART methods. In this paper, we present a new method for generating diversified mirror test cases by randomly displacing the mirror partitions upon which the mapping functions of MART operates. The result of simulations and experiments conducted shows remarkable improvement over MART's effectiveness and efficiency across MART schemes, especially where program failures are unrelated to one or more input parameters.","PeriodicalId":122665,"journal":{"name":"2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124622320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reliability Analysis of Phased-Mission System in Irrelevancy Coverage Model 不相关覆盖模型下分阶段任务系统可靠性分析
2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS) Pub Date : 2019-07-22 DOI: 10.1109/QRS.2019.00025
Ming-Chang Yang, Dongdong Zhao, Luyao Ye, Siwei Zhou, Jianwen Xiang
{"title":"Reliability Analysis of Phased-Mission System in Irrelevancy Coverage Model","authors":"Ming-Chang Yang, Dongdong Zhao, Luyao Ye, Siwei Zhou, Jianwen Xiang","doi":"10.1109/QRS.2019.00025","DOIUrl":"https://doi.org/10.1109/QRS.2019.00025","url":null,"abstract":"In a phased-mission system (PMS), an uncovered component fault may lead to a mission failure regardless of the status of other components, and the reliability can be analyzed with traditional imperfect fault coverage model (IFCM). The IFCM, however, only considers the coverage of faulty components. Recently, an irrelevancy coverage model (ICM) is proposed to cover both faulty components and irrelevant components, but the analysis is limited to normal non-phased mission systems. This paper first demonstrates that, the coverage of irrelevant components is also important in PMSs, as an initially relevant component could also become irrelevant later due to the failures of other components, and an uncovered fault of irrelevant component may threaten the whole mission as well. A method to analyze the reliability of PMS in ICM is proposed using sum of disjoint products (SDP) technique. Experimental results demonstrate not only the effectiveness of the proposed reliability analysis method, but also that the ICM can achieve higher reliability than the IFCM for PMSs in general.","PeriodicalId":122665,"journal":{"name":"2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS)","volume":"354 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115928812","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信