2023 IEEE Conference on Software Testing, Verification and Validation (ICST)最新文献

筛选
英文 中文
Embedding Context as Code Dependencies for Neural Program Repair 嵌入上下文作为神经程序修复的代码依赖项
2023 IEEE Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2023-04-01 DOI: 10.1109/ICST57152.2023.00018
Noor Nashid, Mifta Sintaha, A. Mesbah
{"title":"Embedding Context as Code Dependencies for Neural Program Repair","authors":"Noor Nashid, Mifta Sintaha, A. Mesbah","doi":"10.1109/ICST57152.2023.00018","DOIUrl":"https://doi.org/10.1109/ICST57152.2023.00018","url":null,"abstract":"Deep learning-based program repair has received significant attention from the research community lately. Most existing techniques treat source code as a sequence of tokens or abstract syntax trees. Consequently, they cannot incorporate semantic contextual information pertaining to a buggy line of code and its fix. In this work, we propose a program repair technique called GLANCE that combines static program analysis with graph-to-sequence learning for capturing contextual information. To represent contextual information, we introduce a graph representation that can encode information about the buggy code and its repair ingredients by embedding control and data flow information. We employ a fine-grained graphical code representation, which explicitly describes code change context and embeds semantic relationships between code elements. GLANCE leverages a graph neural network and a sequence-based decoder to learn from this semantic code representation. We evaluated our work against six state-of-the-art techniques, and our results show that GLANCE fixes 52% more bugs than the best performing technique.","PeriodicalId":128686,"journal":{"name":"2023 IEEE Conference on Software Testing, Verification and Validation (ICST)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116956684","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
Flake Aware Culprit Finding Flake意识到罪魁祸首
2023 IEEE Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2023-04-01 DOI: 10.1109/ICST57152.2023.00041
Tim A. D. Henderson, Bobby Dorward, Eric Nickell, Collin Johnston, Avi Kondareddy
{"title":"Flake Aware Culprit Finding","authors":"Tim A. D. Henderson, Bobby Dorward, Eric Nickell, Collin Johnston, Avi Kondareddy","doi":"10.1109/ICST57152.2023.00041","DOIUrl":"https://doi.org/10.1109/ICST57152.2023.00041","url":null,"abstract":"When a change introduces a bug into a large software repository, there is often a delay between when the change is committed and when bug is detected. This is true even when the bug causes an existing test to fail! These delays are caused by resource constraints which prevent the organization from running all of the tests on every change. Due to the delay, a Continuous Integration system needs to locate buggy commits. Locating them is complicated by flaky tests that pass and fail non-deterministically. The flaky tests introduce noise into the CI system requiring costly reruns to determine if a failure was caused by a bad code change or caused by non-deterministic test behavior. This paper presents an algorithm, Flake Aware Culprit Finding, that locates buggy commits more accurately than a traditional bisection search. The algorithm is based on Bayesian inference and noisy binary search, utilizing prior information about which changes are most likely to contain the bug. A large scale empirical study was conducted at Google on 13,000+ test breakages. The study evaluates the accuracy and cost of the new algorithm versus a traditional deflaked bisection search.","PeriodicalId":128686,"journal":{"name":"2023 IEEE Conference on Software Testing, Verification and Validation (ICST)","volume":"12 s1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120843512","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
Two Sparsification Strategies for Accelerating Demand-Driven Pointer Analysis 加速需求驱动指针分析的两种稀疏化策略
2023 IEEE Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2023-04-01 DOI: 10.1109/ICST57152.2023.00036
K. Karakaya, E. Bodden
{"title":"Two Sparsification Strategies for Accelerating Demand-Driven Pointer Analysis","authors":"K. Karakaya, E. Bodden","doi":"10.1109/ICST57152.2023.00036","DOIUrl":"https://doi.org/10.1109/ICST57152.2023.00036","url":null,"abstract":"To resolve aliasing, precise program analyses rely on pointer analyses. Demand-driven pointer analysis seeks to be efficient by computing information only for variables on which a demand is raised, through a points-to or alias query. Yet, research has shown that when applied to large-scale programs even demand-driven analyses can become expensive in terms of memory and runtime. This paper thus investigates to what extent demand-driven pointer analysis can be accelerated further if being executed over a sparse control-flow graph (CFG), specialized to those queries. We investigate two designs: First, typeaware sparsification, in which the resulting CFG only consists of statements containing variables that are type compatible with the query variable. Second, alias-aware sparsification, where the resulting CFG consists of the def-use chains of the query variable and all its intra-procedural aliases.We implement both designs in SparseBoomerang by extending Boomerang, a pointer analysis framework based on push-down systems. We evaluate SparseBoomerang by comparing it to Boomerang in terms of precision and performance. On the Pointerbench micro-benchmark suite for alias analysis, SparseBoomerang maintains the precision of Boomerang, in both designs. We evaluate the runtime and memory performance of SparseBoomerang by using Flowdroid as a taint analysis client on real-world apps. Compared to the baseline Boomerang, on average SparseBoomerang solves alias queries 2.4x faster when using the type-aware sparsification strategy, and 2.8x faster when using the alias-aware variant with negligible memory overhead.","PeriodicalId":128686,"journal":{"name":"2023 IEEE Conference on Software Testing, Verification and Validation (ICST)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125908259","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
Software Testing Research Challenges: An Industrial Perspective 软件测试研究挑战:工业视角
2023 IEEE Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2023-04-01 DOI: 10.1109/ICST57152.2023.00008
N. Alshahwan, M. Harman, Alexandru Marginean
{"title":"Software Testing Research Challenges: An Industrial Perspective","authors":"N. Alshahwan, M. Harman, Alexandru Marginean","doi":"10.1109/ICST57152.2023.00008","DOIUrl":"https://doi.org/10.1109/ICST57152.2023.00008","url":null,"abstract":"There have been rapid recent developments in automated software test design, repair and program improvement. Advances in artificial intelligence also have great potential impact to tackle software testing research problems. In this paper we highlight open research problems and challenges from an industrial perspective. This perspective draws on our experience at Meta Platforms, which has been actively involved in software testing research and development for approximately a decade. As we set out here, there are many exciting opportunities for software testing research to achieve the widest and deepest impact on software practice. With this overview of the research landscape from an industrial perspective, we aim to stimulate further interest in the deployment of software testing research. We hope to be able to collaborate with the scientific community on some of these research challenges.","PeriodicalId":128686,"journal":{"name":"2023 IEEE Conference on Software Testing, Verification and Validation (ICST)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128549148","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
Mining Attributed Input Grammars and their Applications in Fuzzing 挖掘属性输入语法及其在模糊分析中的应用
2023 IEEE Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2023-04-01 DOI: 10.1109/ICST57152.2023.00059
A. Pointner
{"title":"Mining Attributed Input Grammars and their Applications in Fuzzing","authors":"A. Pointner","doi":"10.1109/ICST57152.2023.00059","DOIUrl":"https://doi.org/10.1109/ICST57152.2023.00059","url":null,"abstract":"Undetected errors in software systems are a common cause of vulnerabilities and security holes. Grammar Fuzzing is an effective method for testing these systems, but it has limitations such as lack of knowledge about the semantics of the program and difficulty obtaining grammar for these systems. To address these limitations, we propose an approach to automatically mine grammars, and enhance it with semantic rules and contextual constraints to create attribute grammars. These attribute grammars can then be used for fuzzing. Our preliminary results show that this automated extraction process is feasible, as we successfully applied it to an expression parser and were able to extract an attribute grammar representing the parser’s functionality.","PeriodicalId":128686,"journal":{"name":"2023 IEEE Conference on Software Testing, Verification and Validation (ICST)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132015256","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
How Closely are Common Mutation Operators Coupled to Real Faults? 常见突变算子与实际故障的耦合有多紧密?
2023 IEEE Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2023-04-01 DOI: 10.1109/ICST57152.2023.00021
Gregory Gay, Alireza Salahirad
{"title":"How Closely are Common Mutation Operators Coupled to Real Faults?","authors":"Gregory Gay, Alireza Salahirad","doi":"10.1109/ICST57152.2023.00021","DOIUrl":"https://doi.org/10.1109/ICST57152.2023.00021","url":null,"abstract":"In mutation testing, faulty versions of a program are generated through automated modifications of source code. These mutants are used to assess and improve test suite quality, under the assumption that detection of mutants is indicative of a test suite’s ability to detect real faults—i.e., that mutants and faults have a semantic relationship. Improving the effectiveness—in both cost and quality—of mutation testing may lie in better understanding this relationship, in particular with regard to how individual mutation operators (types) couple to real faults.In this study, we examine coupling between 32,002 mutants produced by 31 mutation operators and 144 real faults, using a scale based on number of failing tests and reasons for failure. Ultimately, we observed that 9.92% of the mutants are strongly coupled to real faults, and 51.03% of the faults have at least one strongly coupled mutant. We identify and examine mutation operators with the highest median coupling, as well as the operators that tend to produce non-compiling mutants, undetected mutants, and mutants that cause tests other than those that detect the actual fault to fail. We also examine how coupling could be used to filter the set of operators employed, leading to potentially significant cost savings during mutation testing. Our findings could lead to improvements in how mutation testing is applied, improved implementation of specific mutation operators, and inspiration for new mutation operators.","PeriodicalId":128686,"journal":{"name":"2023 IEEE Conference on Software Testing, Verification and Validation (ICST)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131885067","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
Pairwise Testing Revisited for Structured Data With Constraints 带约束的结构化数据的成对测试
2023 IEEE Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2023-04-01 DOI: 10.1109/ICST57152.2023.00027
Luca Vittorio Sartori, H. Waeselynck, Jérémie Guiochet
{"title":"Pairwise Testing Revisited for Structured Data With Constraints","authors":"Luca Vittorio Sartori, H. Waeselynck, Jérémie Guiochet","doi":"10.1109/ICST57152.2023.00027","DOIUrl":"https://doi.org/10.1109/ICST57152.2023.00027","url":null,"abstract":"Pairwise testing (PT) exercises the interactions of pairs of input parameters. The approach is classically defined for a flat set of parameters, the number of which is fixed. Such a definition does not fit well with applications that process structured data like XML and JSON documents. This paper revisits the PT concepts to accommodate hierarchical data structures. The choices and pairs are created by considering the multiplicity of data instances, their access paths and common ancestors. The revised PT approach is implemented on top of on a recent data generation tool, TAF. TAF mixes random sampling and constraint solving to produce diverse data from XML-based models. Our PT implementation interacts with TAF by inserting pair coverage constraints into the models. It monitors overall coverage progress by XPath queries on the data returned by TAF. The approach is demonstrated for two data models: a 3D scene for an agricultural robot, and a population of taxpayers for a tax management system.","PeriodicalId":128686,"journal":{"name":"2023 IEEE Conference on Software Testing, Verification and Validation (ICST)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124127054","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
BinaryRTS: Cross-language Regression Test Selection for C++ Binaries in CI 在CI中选择c++二进制文件的跨语言回归测试
2023 IEEE Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2023-04-01 DOI: 10.1109/ICST57152.2023.00038
Daniel Elsner, Severin Kacianka, Stephan Lipp, A. Pretschner, Axel Habermann, Maria Graber, Silke Reimer
{"title":"BinaryRTS: Cross-language Regression Test Selection for C++ Binaries in CI","authors":"Daniel Elsner, Severin Kacianka, Stephan Lipp, A. Pretschner, Axel Habermann, Maria Graber, Silke Reimer","doi":"10.1109/ICST57152.2023.00038","DOIUrl":"https://doi.org/10.1109/ICST57152.2023.00038","url":null,"abstract":"Continuous integration (CI) pipelines are commonly used to execute regression tests before pull requests are merged. Regression test selection (RTS) aims to reduce the required testing effort and feedback time for developers. However, existing RTS techniques are imprecise for tests with cross-language links to compiled C++ binaries or unsafe if tests use external files. This is problematic because modern software in fact involves several programming languages and (non-)code artifacts such as configuration files. In this paper, we present BinaryRTS, a novel RTS technique that leverages dynamic binary instrumentation to collect the covered functions and accessed external files for each test. BinaryRTS then selects tests depending on changes issued to C++ binaries or external (non-)code artifacts. When evaluating BinaryRTS in our large-scale industrial context, we are able to exclude on average up to 74% of tests without missing real failures. We release BinaryRTS as the first publicly available RTS tool for software involving C++ code.","PeriodicalId":128686,"journal":{"name":"2023 IEEE Conference on Software Testing, Verification and Validation (ICST)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128647715","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
Automating Endurance Test for Flash-based Storage Devices in Samsung Electronics 三星电子闪存存储设备耐久性自动测试
2023 IEEE Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2023-04-01 DOI: 10.1109/ICST57152.2023.00037
Jinkook Kim, Minseok Jeon, Sejeong Jang, Hakjoo Oh
{"title":"Automating Endurance Test for Flash-based Storage Devices in Samsung Electronics","authors":"Jinkook Kim, Minseok Jeon, Sejeong Jang, Hakjoo Oh","doi":"10.1109/ICST57152.2023.00037","DOIUrl":"https://doi.org/10.1109/ICST57152.2023.00037","url":null,"abstract":"We present ARES, an automated framework for writing endurance tests on flash-based storage devices. Since flash-based storages such as solid-state drives and SD cards have a limited capacity for processing data write requests, it is important for manufacturers to accurately test and specify the maximum amount of data writes that their products are guaranteed to withstand. Unfortunately, however, writing such an endurance test is mostly conducted manually in practice, which is difficult, laborious, and sometimes inaccurate. To address this issue, we present ARES, a learning-based automated approach for generating endurance tests on flash-based storage devices. ARES is built on two ideas. First, we observe that the search space of endurance tests can be effectively reduced by devising abstract relative write patterns. Second, we use a learning algorithm based on genetic programming in order to find worse-case write patterns efficiently. The experimental results demonstrate that ARES is capable of successfully learning highquality write patterns. The performance of the learned write patterns is superior to that of the manual tests designed by human engineers in Samsung Electronics. Especially for 32GB USB, ARES identified a write pattern that is 26% more effective than the manually crafted write pattern that has been used until recently.","PeriodicalId":128686,"journal":{"name":"2023 IEEE Conference on Software Testing, Verification and Validation (ICST)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129236745","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
Distributed Repair of Deep Neural Networks 深度神经网络的分布式修复
2023 IEEE Conference on Software Testing, Verification and Validation (ICST) Pub Date : 2023-04-01 DOI: 10.1109/ICST57152.2023.00017
Davide Li Calsi, Matias Duran, Xiaoyi Zhang, Paolo Arcaini, F. Ishikawa
{"title":"Distributed Repair of Deep Neural Networks","authors":"Davide Li Calsi, Matias Duran, Xiaoyi Zhang, Paolo Arcaini, F. Ishikawa","doi":"10.1109/ICST57152.2023.00017","DOIUrl":"https://doi.org/10.1109/ICST57152.2023.00017","url":null,"abstract":"Deep Neural Networks (DNNs) are applied in several safety-critical domains and their trustworthiness is of paramount importance. For example, DNNs used in autonomous driving as classifiers should not misclassify detected objects; however, since obtaining perfect accuracy is not possible, special attention should be given to the most critical cases, e.g., pedestrians. This has been confirmed by the consortium of our partners from the automotive domain that provided us with specific risk levels for different misclassifications. A recent approach to improve DNN performance is to localise DNN weights responsible for the misclassifications and then adjust (repair) them to improve the misclassifications. However, they under-perform when they need to consider multiple misclassifications, and they do not consider the risk levels of the different misclassifications. To tackle this, we propose DISTRREP, a distributed repair approach that first finds the best fixes for each critical misclassification, and then integrates them in a single repaired DNN model, by considering the risk levels. We assess DISTRREP over three DNN models and a dataset of autonomous driving images, by considering requirements specified by our industrial partners. Experiments show that DISTRREP is more effective than baseline approaches based on retraining, and other risk-unaware repair approaches.","PeriodicalId":128686,"journal":{"name":"2023 IEEE Conference on Software Testing, Verification and Validation (ICST)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133309148","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
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学术官方微信
小红书