检索结果-内蒙古大学图书馆

26th IEEE International Conference on software Analysis, Evolution and Reengineering (SANER)

作者： White, Martin Tufano, Michele Martinez, Matias Monperrus, Martin Poshyvanyk, Denys Coll William & Mary Williamsburg VA 23185 USA Univ Polytech Hauts De France Valenciennes France KTH Royal Inst Technol Stockholm Sweden

ISBN: (纸本)9781728105918

In the field of automated program repair, the redundancy assumption claims large programs contain the seeds of their own repair. However, most redundancy-based program repair techniques do not reason about the repair ingredients-the code that is reused to craft a patch. We aim to reason about the repair ingredients by using code similarities to prioritize and transform statements in a codebase for patch generation. Our approach, DeepRepair, relies on deep learning to reason about code similarities. Code fragments at well-defined levels of granularity in a codebase can be sorted according to their similarity to suspicious elements (i.e., code elements that contain suspicious statements) and statements can be transformed by mapping out-of-scope identifiers to similar identifiers in scope. We examined these new search strategies for patch generation with respect to effectiveness from the viewpoint of a software maintainer. Our comparative experiments were executed on six open-source Java projects including 374 buggy program revisions and consisted of 19,949 trials spanning 2,616 days of computation time. Deep-Repair's search strategy using code similarities generally found compilable ingredients faster than the baseline, jGenProg, but this improvement neither yielded test-adequate patches in fewer attempts (on average) nor found significantly more patches (on average) than the baseline. Although the patch counts were not statistically different, there were notable differences between the nature of DeepRepair patches and jGenProg patches. The results show that our learning-based approach finds patches that cannot be found by existing redundancy-based repair techniques.

关键词： software testing and debugging program repair deep learning neural networks code clones language models

来源：评论

学校读者我要写书评

暂无评论

SNOWCAT: Efficient Kernel Concurrency testing using a Learned Coverage Predictor 23

SNOWCAT: Efficient Kernel Concurrency Testing using a Learne...

引用

29th ACM Symposium on Operating Systems Principles (SOSP)

作者： Gong, Sishuai Peng, Dinglan Altinbuken, Deniz Fonseca, Pedro Maniatis, Petros Purdue Univ W Lafayette IN 47907 USA Google DeepMind New York NY USA

ISBN: (纸本)9798400702297

Random-based approaches and heuristics are commonly used in kernel concurrency testing due to the massive scale of modern kernels and corresponding interleaving space. The lack of accurate and scalable approaches to analyze concurrent kernel executions makes existing testing approaches heavily rely on expensive dynamic executions to measure the effectiveness of a new test. Unfortunately, the high cost incurred by dynamic executions limits the breadth of the exploration and puts latency pressure on finding effective concurrent test inputs and schedules, hindering the overall testing effectiveness. This paper proposes SNOWCAT, a kernel concurrency testing framework that generates effective test inputs and schedules using a learned kernel block-coverage predictor. Using a graph neural network, the coverage predictor takes a concurrent test input and scheduling hints and outputs a prediction on whether certain important code blocks will be executed. Using this predictor, SNOWCAT can skip concurrent tests that are likely to be fruitless and prioritize the promising ones for actual dynamic execution. After testing the Linux kernel for over a week, SNOWCAT finds similar to 17% more potential data races, by prioritizing tests of more fruitful schedules than existing work would have chosen. SNOWCAT can also find effective test inputs that expose new concurrency bugs with higher probability (1.4x similar to 2.6x), or reproduce known bugs more quickly (15x) than state-of-art testing tools. More importantly, SNOWCAT is shown to be more *** at reaching a desirable level of race coverage in the continuous setting, as the Linux kernel evolves from version to version. In total, SNOWCAT discovered 17 new concurrency bugs in Linux kernel 6.1, of which 13 are confirmed and 6 are fixed.

关键词： Kernel concurrency bugs Operating systems security software testing and debugging Concurrency programming

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Region-based Concurrency Bug testing Approach 18

A Heuristic Region-based Concurrency Bug Testing Approach

引用

18th IEEE Int Symp on Parallel and Distributed Proc with Applicat (ISPA) / 10th IEEE Int Conf on Big Data and Cloud Comp (BDCloud) / IEEE Int Symp on Social Comp and Networking (SocialCom) / IEEE Int Conf on Sustainable Comp and Commun (SustainCom)

作者： Chin, Kuo-Cheng Tsay, Ren-Song Wu, Hsin-I Natl Tsing Hua Univ Inst Informat Syst & Applicat Taipei Taiwan Natl Tsing Hua Univ Dept Elect Engn Hsinchu Taiwan Natl Tsing Hua Univ Dept Comp Sci Hsinchu Taiwan

ISBN: (纸本)9781665414852

In this paper, we propose an effective concurrency bug testing approach that focuses on suspicious bug-causing code regions instead of indiscriminately testing the whole program. Additionally, with a simple loop heuristic, the region-based approach effectively avoids the state explosion problem. It is highly efficient while guaranteeing to find any existing concurrency bugs in the specified code regions. We also devise an optimization scheme to reduce the number of interleavings to be examined to achieve maximum efficiency. Our method can conveniently identify bug-causing interleavings and hence significantly improve debugging efficiency. We have implemented the proposed approach and successfully tested on a few large application cases. The experimental results show that the approach can precisely identify bug sources and perform much more effectively than traditional approaches.

关键词： software testing and debugging region concurrency testing concurrency bugs interleaving systematic state explosion problem

来源：评论

学校读者我要写书评

暂无评论

Snowboard: Finding Kernel Concurrency Bugs through Systematic Inter-thread Communication Analysis 21

Snowboard: Finding Kernel Concurrency Bugs through Systemati...

引用

28th ACM Symposium on Operating Systems Principles (SOSP)

作者： Gong, Sishuai Altinbuken, Deniz Fonseca, Pedro Maniatis, Petros Purdue Univ W Lafayette IN 47907 USA Google Res Boston MA USA

ISBN: (纸本)9781450387095

Kernel concurrency bugs are challenging to find because they depend on very specific thread interleavings and test inputs. While separately exploring kernel thread interleavings or test inputs has been closely examined, jointly exploring interleavings and test inputs has received little attention, in part due to the resulting vast search space. Using precious, limited testing resources to explore this search space and execute just the right concurrent tests in the proper order is critical. This paper proposes Snowboard a testing framework that generates and executes concurrent tests by intelligently exploring thread interleavings and test inputs jointly. The design of Snowboard is based on a concept called potential memory communication (PMC), a guess about pairs of tests that, when executed concurrently, are likely to perform memory accesses to shared addresses, which in turn may trigger concurrency bugs. To identify PMCs, Snowboard runs tests sequentially from a fixed initial kernel state, collecting their memory accesses. It then pairs up tests that write and read the same region into candidate concurrent tests. It executes those tests using the associated PMC as a scheduling hint to focus interleaving search only on those schedules that directly affect the relevant memory accesses. By clustering candidate tests on various features of their PMCs, Snowboard avoids testing similar behaviors, which would be inefficient. Finally, by executing tests from small clusters first, it prioritizes uncommon suspicious behaviors that may have received less scrutiny. Snowboard discovered 14 new concurrency bugs in Linux kernels 5.3.10 and 5.12-rc3, of which 12 have been confirmed by developers. Six of these bugs cause kernel panics and filesystem errors, and at least two have existed in the kernel for many years, showing that this approach can uncover hard-to-find, critical bugs. Furthermore, we show that covering as many distinct pairs of uncommon read/write instructions as po

关键词： Kernel concurrency bug Operating systems security software testing and debugging Concurrency programming

来源：评论

学校读者我要写书评

暂无评论

testing Embedded software by Metamorphic testing: a Wireless Metering System Case Study

Testing Embedded Software by Metamorphic Testing: a Wireless...

引用

36th Annual IEEE Conference on Local Computer Networks (LCN)

作者： Kuo, Fei-Ching Chen, Tsong Yueh Tam, Wing K. Swinburne Univ Technol Fac Informat & Commun Technol Hawthorn Vic 3122 Australia

ISBN: (纸本)9781612849287

In this paper, we present our experience of testing wireless embedded software. We used a wireless metering system in operation, and its software as a case study to demonstrate how a property-based testing technique, called metamorphic testing, can be used in detecting software failures of this wireless embedded system. Our study shows that a careful design of test environments and selection of system properties will enable us to trace back the cause of failures and help in fault diagnosis and debugging.

关键词： Wireless communication embedded systems software testing and debugging

来源：评论

学校读者我要写书评

暂无评论

Finding and Tolerating Concurrency Bugs

Finding and Tolerating Concurrency Bugs

引用

作者： Yu, Jie University of Michigan

学位级别：Ph.D.

Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can interleave in so many different ways. To ensure correctness, a programmer has to test all possible thread interleavings, which, however, is impractical. Many rare thread interleavings remain untested in production systems, and they are the major cause for a majority of concurrency bugs. Given that untested interleavings are the major cause of a majority of the concurrency bugs, this dissertation explores two possible ways to tackle concurrency bugs in this dissertation. One is to expose untested interleavings during testing to find concurrency bugs. The other is to avoid untested interleavings during production runs to tolerate concurrency bugs. The key is an efficient and effective way to encode and remember tested interleavings. This dissertation first discusses two hypotheses about concurrency bugs: the small scope hypothesis and the value independent hypothesis. Based on these two hypotheses, this dissertation defines a set of interleaving patterns, called interleaving idioms, which are used to encode tested interleavings. The empirical analysis shows that the idiom based interleaving encoding scheme is able to represent most of the concurrency bugs that are used in the study. Then, this dissertation discusses an open source testing tool called Maple. It memoizes tested interleavings and actively seeks to expose untested interleavings. The results show that Maple is able to expose concurrency bugs and expose interleavings faster than other conventional testing techniques. Finally, this dissertation discusses two parallel runtime system designs which seek to avoid untested interleavings during production runs to tolerate concurrency bugs. Avoiding untested interleavings significantly improve correctness because most of the concurrency bugs are caused by untested interleavings. Also, the pe

关键词： Parallel Programming Concurrency Bugs Interleaving Constrained software testing and debugging Coverage Thesis

来源：评论

学校读者我要写书评

暂无评论

Spectrum-based rule- and item-level localization of faults in context-free grammars

引用

JOURNAL OF SYSTEMS AND software 2024年 215卷

作者： Raselimo, Moeketsi Fischer, Bernd Stellenbosch Univ Stellenbosch South Africa

We describe and evaluate spectrum -based methods aimed at finding faults in context -free grammars. In their basic form, they take as input a test suite and a parser for the grammar that is modified to collect grammar spectra (i.e., the sets of grammar elements used in attempts to parse the individual test cases), and return as output a ranked list of suspicious elements. We define grammar spectra suitable for localizing faults on the level of the grammar rules (i.e., rule spectra) and the rules' individual symbols (i.e., item spectra), respectively. We show how both types of grammar spectra can be collected by both LL and LR parsers, and how the JavaCC, ANTLR, and CUP parser generators can be modified and used to automate the collection of the grammar spectra. We also show how grammar spectra can be synthesized directly from test cases derived from a grammar, and how such synthetic spectra can be used to localize differences between a grammar and a black -box system under test. We first evaluate our approach over a large number of medium-sized single fault grammars, which we constructed by fault seeding from a common origin grammar. At the rule level, it ranks the rules containing the seeded faults within the top five rules in about 40%-70% of the cases, depending on the applied parsing technique, test suite, and ranking metric, and pinpoints them (i.e., correctly identifies them as unique most suspicious rule) in about 10%-30% of the cases, with significantly better results for the synthetic spectra. At the item level, our approach remains remarkably effective despite the larger number of possible locations, provided it is coupled with a simple tie -breaking strategy that prefers items with the right -most designated position over other items from the same rules in a tie. It typically ranks the seeded faults within the top five positions in about 30%-60% of the cases, and pinpoints them in about 15%-40% of the cases. This specialized item -level localization also

关键词： software testing and debugging Grammars and context-free languages

来源：评论

学校读者我要写书评

暂无评论

Grammar-based test suite construction using coverage-directed algorithms over LR-graphs

引用

JOURNAL OF SYSTEMS AND software 2024年 214卷

作者： Rossouw, Christoff Fischer, Bernd Stellenbosch Univ Div Comp Sci Stellenbosch South Africa

In grammar -based testing, the test suites that drive the system under test are typically constructed from a given context -free grammar through a set of derivations that jointly satisfy some coverage criterion. In this paper, we describe and evaluate a new algorithm that instead constructs test suites from a set of valid paths that cover all edges in a labeled directed graph corresponding to an LR-automaton that accepts the language of the grammar. Vertices in this graph correspond to states in the LR-automaton;two vertices are connected by an edge iff the top of the LR-automaton's stack can change from one state to the other, either by shifting a terminal or non -terminal symbol (push edges), or by reducing with a grammar rule (pop edges). The algorithm constructs a unique reduction path for each pop edge in the graph. These reduction paths are recursively embedded into each other, and any unresolved non -terminal push edges are substituted by shortest derivations for the non -terminal symbol. The algorithm can work with different types of LR-automata, including LR(0)- and LR(1)automata, and can successfully generate a test suite from an LR-graph even if the underlying LR-automaton construction leads to shift/reduce or reduce/reduce conflicts. The algorithm only constructs valid paths over the LR-graphs that correspond to sentences in the language and thus generates only positive tests. We therefore also describe mutations to the positive paths that are guaranteed to generate negative tests without needing any further verification by an oracle. Our algorithm is substantially more efficient than an earlier algorithm that explores LR-graphs with two consecutive breadth -first graph traversals and our experimental evaluation shows that it scales to large production -quality grammars. It is robust against random choices made to resolve ambiguity in the construction of the tests, while the code coverage of the different test suite variants is relatively uniform. Finall

关键词： software testing and debugging Grammars and context-free languages Test case generation Push-down automata

来源：评论

学校读者我要写书评

暂无评论

An Integrated Framework for Developing Discrete-Time Modelling in software Reliability Engineering

引用

QUALITY AND RELIABILITY ENGINEERING INTERNATIONAL 2016年第8期32卷 2925-2943页

作者： Shatnawi, Omar Al Al Bayt Univ Dept Comp Sci Mafraq 25113 Jordan

In the software reliability engineering literature, few attempts have been made to study the fault debugging environment using discrete-time modelling. Most endeavours assume that a detected fault to have been either immediately removed or is perfectly debugged. Such discrete-time models may be used for any debugging environment and may be termed black-box, which are used without having prior knowledge about the nature of the fault being debugged. However, if one has to develop a white-box model, one needs to be cognizant of the debugging environment. During debugging, there are numerous factors that affect the debugging process. These factors may include the internal, for example, fault density, and fault debugging complexity and the external that originates in the debugging environment itself, such as the skills of the debugging team and the debugging effort expenditures. Hence, the debugging environment fault removal may take a longer time after having been detected. Therefore, it is imperative to clearly understand the testing and debugging environment and, hence, the urgency to develop a model. The model ought to take into account the fault debugging complexity and incorporate the learning phenomenon of the debugger under imperfect debugging environment. This objective dictates developing a framework through an integrated modelling approach based on nonhomogenous Poisson process that incorporates these realistic factors during the fault debugging process. Actual software reliability data have been used to demonstrate applicability of the proposed integrated framework. Copyright (C) 2016 John Wiley & Sons, Ltd.

关键词： software reliability engineering software testing and debugging nonhomogenous Poisson process imperfect fault debugging fault debugging complexity

来源：评论

学校读者我要写书评

暂无评论

A Two-Stage Algorithm for Identifying software Failure Regions

引用

IEEE TRANSACTIONS ON RELIABILITY 2024年

作者： Mao, Chengying Zhu, Zheng Chen, Tsong Yueh Towey, Dave Wen, Linlin Chen, Jifu Jiangxi Univ Finance & Econ Sch Software & IoT Engn Nanchang 330013 Peoples R China Zhejiang Univ Sch Software Technol Ningbo 315048 Peoples R China Swinburne Univ Technol Dept Comp Sci & Software Engn Hawthorn Vic 3122 Australia Univ Nottingham Ningbo China Sch Comp Sci Ningbo 315100 Peoples R China

software developers can only obtain a very small amount of information from the individual failure-causing inputs, which makes debugging difficult. Therefore, it is necessary to explore additional failure-causing inputs (failure regions) using the known failure-causing inputs. In order to accurately and efficiently identify the failure region, we propose a novel two-stage search algorithm, TS-FRI. In the initial exploration stage, a round-robin search identifies several boundary failure-causing points, and the failure region's centroid is estimated. During the main search stage, the boundary failure-causing points are identified through iterative division of the input domain with an equally sized partitioning strategy. This results in the boundary points being as dispersed as possible around the failure-region boundary, with the polytope formed by the points approximating the failure region (e.g., a polygon in two dimensions). The proposed algorithm is validated through simulation and empirical analysis: The experimental results show that the TS-FRI accuracy is at least comparable to the best accuracy of the compared three algorithms, and can be ten times better. In addition, TS-FRI only takes a quarter of the computation time and half the failure-validation cost of the other algorithms.

关键词： software software algorithms Codes Costs Accuracy debugging software testing Accuracy and efficiency failure region identification failure-based testing software failure software testing and debugging

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：