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

筛选
英文 中文
An improved mapping method for automated consistency check between software architecture and source code 一种改进的用于软件架构与源代码之间自动一致性检查的映射方法
Fangwei Chen, Li Zhang, Xiaoli Lian
{"title":"An improved mapping method for automated consistency check between software architecture and source code","authors":"Fangwei Chen, Li Zhang, Xiaoli Lian","doi":"10.1109/QRS51102.2020.00021","DOIUrl":"https://doi.org/10.1109/QRS51102.2020.00021","url":null,"abstract":"In daily software development, inconsistencies between architecture and code inevitably occur with the continuous contribution, even under model-driven development which can trace between design and code. Many methods have been proposed for consistency checking, but most require huge human efforts on establishing the mappings between architectural and code elements. Besides, the multi-layered architecture and code increases the difficulties in inconsistency detection, while existing algorithms do not handle this well. Thus, we propose an improved mapping method for automated consistency check between software architecture and Java implementation, with the premises that initial tracing between architecture and code are established. To be specific, during software evolution, our method can automatically re-establish the mappings between architecture and code using initial tracing information. Then, with detailed inconsistency check rules, we detect the inconsistencies heuristically. Experiments with two projects show our method’s high effectiveness with more than 98% of recall and 96% of precision.","PeriodicalId":301814,"journal":{"name":"2020 IEEE 20th International Conference on Software Quality, Reliability and Security (QRS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115156293","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
Early Detection of Smart Ponzi Scheme Contracts Based on Behavior Forest Similarity 基于行为森林相似性的智能庞氏骗局合约早期检测
Weisong Sun, Guangyao Xu, Z. Yang, Zhenyu Chen
{"title":"Early Detection of Smart Ponzi Scheme Contracts Based on Behavior Forest Similarity","authors":"Weisong Sun, Guangyao Xu, Z. Yang, Zhenyu Chen","doi":"10.1109/QRS51102.2020.00047","DOIUrl":"https://doi.org/10.1109/QRS51102.2020.00047","url":null,"abstract":"Smart contracts empowered by blockchains often manage digital assets in a distributed and decentralized environment. People believe in smart contracts based on these new technologies. Unfortunately, malicious smart contacts, such as smart Ponzi scheme contracts (ponzitracts, for short), pose risk. Existing techniques detect ponzitracts by analyzing the code as well as a large amount of transaction data after time-consuming deployment. However, a conclusion based on transaction data can only be gotten after the damage has been caused. This paper proposes PonziDetector, a ponzitract detection technique that does not rely on transaction data. Behavior forest is introduced into PonziDetector to capture dynamic behaviors of smart contracts during interacting with them, which makes it possible to early detect ponzitracts. The empirical study demonstrates that PonziDetector, without transaction data, can improve the precision and the recall of the state-of-the-art to 94.6% and 93.0% respectively. This means that PonziDetector can avoid potential losses by early detecting ponzitracts.","PeriodicalId":301814,"journal":{"name":"2020 IEEE 20th International Conference on Software Quality, Reliability and Security (QRS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125072713","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}
引用次数: 7
Pull Request Prioritization Algorithm based on Acceptance and Response Probability 基于接受和响应概率的拉请求优先排序算法
M. Azeem, Q. Peng, Qing Wang
{"title":"Pull Request Prioritization Algorithm based on Acceptance and Response Probability","authors":"M. Azeem, Q. Peng, Qing Wang","doi":"10.1109/QRS51102.2020.00041","DOIUrl":"https://doi.org/10.1109/QRS51102.2020.00041","url":null,"abstract":"Pull requests (PRs) prioritization is one of the main challenges faced by integrators in pull-based development. This is especially true for large open-source projects where hundreds of pull requests are submitted daily. Indeed, managing these pull requests manually consumes time and resources and may lead to delays in the reaction (i.e., acceptance or response) to enhancements or bug fixes suggested in the codebase by contributors. We propose an approach, called AR-Prioritizer (Acceptance and Response based Prioritizer), integrating a PRs prioritization mechanism that considers these two aspects. The results of our study demonstrate that our approach can recommend top@5, top@10, and top@20 most likely to be accepted and responded pull requests with Mean Average Precision of 95.3%, 89.6%, and 79.6% and Average Recall of 40%, 65.7%, and 92.9%. Moreover, AR-Prioritizer has outperformed the baseline models with a statistical significance in prioritizing the most likely to be accepted and responded to PRs.","PeriodicalId":301814,"journal":{"name":"2020 IEEE 20th International Conference on Software Quality, Reliability and Security (QRS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115475947","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
Towards Analyzing Contributions from Software Repositories to Optimize Issue Assignment 分析软件库贡献以优化问题分配
Vasileios Matsoukas, Themistoklis G. Diamantopoulos, Michail D. Papamichail, A. Symeonidis
{"title":"Towards Analyzing Contributions from Software Repositories to Optimize Issue Assignment","authors":"Vasileios Matsoukas, Themistoklis G. Diamantopoulos, Michail D. Papamichail, A. Symeonidis","doi":"10.1109/QRS51102.2020.00042","DOIUrl":"https://doi.org/10.1109/QRS51102.2020.00042","url":null,"abstract":"Most software teams nowadays host their projects online and monitor software development in the form of issues/tasks. This process entails communicating through comments and reporting progress through commits and closing issues. In this context, assigning new issues, tasks or bugs to the most suitable contributor largely improves efficiency. Thus, several automated issue assignment approaches have been proposed, which however have major limitations. Most systems focus only on assigning bugs using textual data, are limited to projects explicitly using bug tracking systems, and may require manually tuning parameters per project. In this work, we build an automated issue assignment system for GitHub, taking into account the commits and issues of the repository under analysis. Our system aggregates feature probabilities using a neural network that adapts to each project, thus not requiring manual parameter tuning. Upon evaluating our methodology, we conclude that it can be efficient for automated issue assignment.","PeriodicalId":301814,"journal":{"name":"2020 IEEE 20th International Conference on Software Quality, Reliability and Security (QRS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116008419","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
Revisiting the Impact of Concept Drift on Just-in-Time Quality Assurance 重新审视概念漂移对准时制质量保证的影响
K. E. Bennin, N. Ali, J. Börstler, Xiao Yu
{"title":"Revisiting the Impact of Concept Drift on Just-in-Time Quality Assurance","authors":"K. E. Bennin, N. Ali, J. Börstler, Xiao Yu","doi":"10.1109/QRS51102.2020.00020","DOIUrl":"https://doi.org/10.1109/QRS51102.2020.00020","url":null,"abstract":"The performance of software defect prediction(SDP) models is known to be dependent on the datasets used for training the models. Evolving data in a dynamic software development environment such as significant refactoring and organizational changes introduces new concept to the prediction model, thus making improved classification performance difficult. In this study, we investigate and assess the existence and impact of concept drift on SDP performances. We empirically asses the prediction performance of five models by conducting cross-version experiments using fifty-five releases of five open-source projects. Prediction performance fluctuated as the training datasets changed over time. Our results indicate that the quality and the reliability of defect prediction models fluctuate over time and that this instability should be considered by software quality teams when using historical datasets. The performance of a static predictor constructed with data from historical versions may degrade over time due to the challenges posed by concept drift.","PeriodicalId":301814,"journal":{"name":"2020 IEEE 20th International Conference on Software Quality, Reliability and Security (QRS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126821989","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}
引用次数: 6
Continuous Implicit Authentication through Touch Traces Modelling 通过触摸轨迹建模的连续隐式认证
Thomas Karanikiotis, Michail D. Papamichail, Kyriakos C. Chatzidimitriou, Napoleon-Christos I. Oikonomou, A. Symeonidis, S. Saripalle
{"title":"Continuous Implicit Authentication through Touch Traces Modelling","authors":"Thomas Karanikiotis, Michail D. Papamichail, Kyriakos C. Chatzidimitriou, Napoleon-Christos I. Oikonomou, A. Symeonidis, S. Saripalle","doi":"10.1109/QRS51102.2020.00026","DOIUrl":"https://doi.org/10.1109/QRS51102.2020.00026","url":null,"abstract":"Nowadays, the continuously increasing use of smart-phones as the primary way of dealing with day-to-day tasks raises several concerns mainly focusing on privacy and security. In this context and given the known limitations and deficiencies of traditional authentication mechanisms, a lot of research efforts are targeted towards continuous implicit authentication on the basis of behavioral biometrics. In this work, we propose a methodology towards continuous implicit authentication that refrains from the limitations imposed by small-scale and/or controlled environment experiments by employing a real-world application used widely by a large number of individuals. Upon constructing our models using Support Vector Machines, we introduce a confidence-based methodology, in order to strengthen the effectiveness and the efficiency of our approach. The evaluation of our methodology on a set of diverse scenarios indicates that our approach achieves good results both in terms of efficiency and usability.","PeriodicalId":301814,"journal":{"name":"2020 IEEE 20th International Conference on Software Quality, Reliability and Security (QRS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124116263","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}
引用次数: 7
STSL: A Novel Spatio-Temporal Specification Language for Cyber-Physical Systems STSL:一种新的网络物理系统时空规范语言
Tengfei Li, Jing Liu, Jiexiang Kang, Haiying Sun, Wei Yin, Xiaohong Chen, Hongya Wang
{"title":"STSL: A Novel Spatio-Temporal Specification Language for Cyber-Physical Systems","authors":"Tengfei Li, Jing Liu, Jiexiang Kang, Haiying Sun, Wei Yin, Xiaohong Chen, Hongya Wang","doi":"10.1109/QRS51102.2020.00048","DOIUrl":"https://doi.org/10.1109/QRS51102.2020.00048","url":null,"abstract":"Combining spatial and temporal primitives together is quite useful to specify dynamic behaviors of cyber-physical systems. The ability to represent spatiotemporal properties by means of formulas in spatiotemporal logics has recently found important applications in various fields, such as runtime verification, parameter synthesis, contract-Based design. In this paper, we present a spatiotemporal specification language, STSL, by combining Signal Temporal Logic (STL) with a spatial logic $mathcal{S}{4_u}$, to characterize spatiotemporal dynamic behaviors of cyber-physical systems. This language is highly expressive: it allows the description of quantitative signals, by expressing spatiotemporal traces over real valued signals in dense time, and Boolean signals, by constraining values of spatial objects across threshold predicates. STSL combines the power of temporal modalities and spatial operators, and enjoys important properties such as safety and liveness. We provide the falsification problem through extending Lemire’s algorithm and a parameter synthesis procedure by calling the simulated annealing algorithm. We demonstrate the proposed approaches on adaptive cruise control system and path planning of quadrotors.","PeriodicalId":301814,"journal":{"name":"2020 IEEE 20th International Conference on Software Quality, Reliability and Security (QRS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126198366","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}
引用次数: 4
PBLInv: Postcondition-based Loop Invariant Learning for C Programs 基于后置条件的C程序循环不变量学习
Hong Lu, Chengyi Wang, Jiacheng Gui, Hao Huang
{"title":"PBLInv: Postcondition-based Loop Invariant Learning for C Programs","authors":"Hong Lu, Chengyi Wang, Jiacheng Gui, Hao Huang","doi":"10.1109/QRS51102.2020.00013","DOIUrl":"https://doi.org/10.1109/QRS51102.2020.00013","url":null,"abstract":"It is challenging to generate loop invariants for programs automatically in the field of software analysis and verification. Loop invariants are the weakened forms of the postconditions for loops. Therefore, we propose PBLInv, a postcondition-based approach to generate loop invariants for C programs with the machine learning method. First, we generate the postcondition for a loop program automatically. Second, we learn classifiers as the updated candidate loop invariants with the Kernel Support Vector Machine (KSVM) method iteratively. PBLInv is evaluated with 60 benchmark programs collected from the recent papers and the 2019 Software Verification Competitions (SV-Comp 2019). The experimental results show that PBLInv is efficient at learning loop invariants for C programs. Compared with five state-of-the-art methods of generating loop invariants, PBLInv not only generates loop invariants for more benchmarks, but also reduces the number of used samples and iterations for learning loop invariants.","PeriodicalId":301814,"journal":{"name":"2020 IEEE 20th International Conference on Software Quality, Reliability and Security (QRS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128116373","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
On the Link Between Refactoring Activity and Class Cohesion Through the Prism of Two Cohesion-Based Metrics 从两个基于内聚度量的棱镜看重构活动和类内聚之间的联系
S. Counsell, Giuseppe Destefanis, S. Swift, Mahir Arzoky, D. Taibi
{"title":"On the Link Between Refactoring Activity and Class Cohesion Through the Prism of Two Cohesion-Based Metrics","authors":"S. Counsell, Giuseppe Destefanis, S. Swift, Mahir Arzoky, D. Taibi","doi":"10.1109/QRS51102.2020.00024","DOIUrl":"https://doi.org/10.1109/QRS51102.2020.00024","url":null,"abstract":"The practice of refactoring has evolved over the past thirty years to become standard developer practice; for almost the same amount of time, proposals for measuring object-oriented cohesion have also been suggested. Yet, we still know very little about their inter-relationship empirically, despite the fact that classes exhibiting low cohesion would be strong candidates for refactoring. In this paper, we use a large set of refactorings to understand the characteristics of two cohesion metrics from a refactoring perspective. Firstly, through the well-known LCOM metric of Chidamber and Kemerer and, secondly, the C3 metric proposed more recently by Marcus et al. Our research question is motivated by the premise that different refactorings will be applied to classes with low cohesion compared with those applied to classes with high cohesion. We used three open-source systems as a basis of our analysis and on data from the lower and upper quartiles of metric data. Results showed that the set of refactoring types across both upper and lower quartiles was broadly the same, although very different in actual numbers. The ‘rename method' refactoring stood out from the rest, being applied over three times as often to classes with low cohesion than to classes with high cohesion.","PeriodicalId":301814,"journal":{"name":"2020 IEEE 20th International Conference on Software Quality, Reliability and Security (QRS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125633711","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
Defect Prediction via LSTM Based on Sequence and Tree Structure 基于序列和树形结构的LSTM缺陷预测
Xuan Zhou, Lu Lu
{"title":"Defect Prediction via LSTM Based on Sequence and Tree Structure","authors":"Xuan Zhou, Lu Lu","doi":"10.1109/QRS51102.2020.00055","DOIUrl":"https://doi.org/10.1109/QRS51102.2020.00055","url":null,"abstract":"With the ever-expanding spread of contemporary software, software defect prediction (SDP) is attracting more and more attention. However, sequential networks used in previous studies, weaken syntactic information and fail to capture longdistance dependencies. To solve these problems, we develop a long short-term memory network based on bidirectional and tree structure (LSTM-BT). Specifically, LSTM-BT combines bidirectional long short-term memory networks (BI-LSTM) and tree long short-term memory networks (Tree-LSTM) to capture semantic and syntactic features from source codes. First, token vectors are captured from the abstract syntax tree (AST). Second, an embedding layer is used to extract semantic information hidden inside the AST nodes. Last, features are fed to the LSTM- BT, which is used to conduct predictions of defect-proneness. To validate our method, we carried out experiments on 8 pairs of Java open-source projects and the results show that LSTM- BT performs better compared to several state-of-the-art defect prediction models.","PeriodicalId":301814,"journal":{"name":"2020 IEEE 20th International Conference on Software Quality, Reliability and Security (QRS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127387176","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}
引用次数: 7
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学术文献互助群
群 号:604180095
Book学术官方微信