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

Can fault-exposure-potential estimates improve the fault detection abilities of test suites?

SOFTWARE TESTING VERIFICATION & RELIABILITY 2002年第4期12卷 197-218页

作者： Chen, W Untch, RH Rothermel, G Elbaun, S von Ronne, J Oregon State Univ Dept Comp Sci Corvallis OR 97331 USA Middle Tennessee State Univ Dept Comp Sci Murfreesboro TN 37130 USA Microsoft Corp Redmond WA 98052 USA Univ Nebraska Dept Comp Sci & Engn Lincoln NE 68588 USA Univ Calif Irvine Dept Informat & Comp Sci Irvine CA 92717 USA

code-coverage-based test data adequacy criteria typically treat all coverable code elements (such as statements, basic blocks or outcomes of decisions) as equal. In practice, however, the probability that a test case can expose a fault in a code element varies: some faults are more easily revealed than others. Thus, several researchers have suggested that if one could estimate the probability that a fault in a code element will cause a failure, one could use this estimate to determine the number of executions of a code element that are required to achieve a certain level of confidence in that element's correctness. This estimate, in turn, could be used to improve the fault-detection effectiveness of test suites and help testers distribute testing resources more effectively. This conjecture is intriguing;however, like many such conjectures it has never been directly examined empirically. If empirical evidence were to support this conjecture, it would motivate further research into methodologies for obtaining fault-exposure-potential estimates and incorporating them into test data adequacy criteria. This paper reports the results of experiments conducted to investigate the effects of incorporating an estimate of fault-exposure probability into the statement coverage test data adequacy criterion. The results of these experiments, however, ran contrary to the conjectures of previous researchers. Although incorporation of the estimates did produce statistically significant increases in the fault-detection effectiveness of test suites, these increases were quite small, suggesting that the approach might not be able to produce the gains hoped for and might not be worth the cost of its employment. Copyright (C) 2002 John Wiley Sons, Ltd.

关键词： software testing test adequacy criteria code coverage fault-exposure potential

来源：评论

学校读者我要写书评

暂无评论

Designing multi-agent unit tests using systematic test design patterns-(extended version)

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2013年第9期26卷 2128-2142页

作者： Khamis, Mohamed A. Nagi, Khaled Egypt Japan Univ Sci & Technol Dept Comp Sci & Engn Alexandria 21934 Egypt Univ Alexandria Fac Engn Dept Comp & Syst Engn Alexandria Egypt

Software agents are the basic building blocks in many software systems especially those based on artificial intelligence methods, e.g., reinforcement learning based multi-agent systems (MASs). However, testing software agents is considered a challenging problem. This is due to the special characteristics of agents which include its autonomy, distributed nature, intelligence, and heterogeneous communication protocols. Following the test-driven development (TDD) paradigm, we present a framework that allows MAS developers to write test scenarios that test each agent individually. The framework relies on the concepts of building mock agents and testing common agent interaction design patterns. We analyze the most common agent interaction patterns including pair and mediation patterns in order to provide stereotype implementation for their corresponding test cases. These implementations serve as test building blocks and are provided as a set of ready-for-reuse components in our repository. This way, the developer can concentrate on testing the business logic itself and spare him/her the burden of implementing tests for the underlying agent interaction patterns. Our framework is based on standard components such as the JADE agent platform, the JUnit framework, and the eclipse plug-in architecture. In this paper, we present in details the design and function of the framework. We demonstrate how we can use the proposed framework to define more stereotypes in the code repository and provide a detailed analysis of the code coverage for our designed stereotype test code implementations. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Multi-agent unit tests Test-driven development Mock agent Agent social design patterns code generation code coverage

来源：评论

学校读者我要写书评

暂无评论

Differences between a static and a dynamic test-to-code traceability recovery method

引用

SOFTWARE QUALITY JOURNAL 2019年第2期27卷 797-822页

作者： Gergely, Tamas Balogh, Gergo Horvath, Ferenc Vancsics, Bela Beszedes, Arpad Gyimothy, Tibor Univ Szeged Dept Software Engn Szeged Hungary Univ Szeged MTA SZTE Res Grp Artificial Intelligence Szeged Hungary

Recovering test-to-code traceability links may be required in virtually every phase of development. This task might seem simple for unit tests thanks to two fundamental unit testing guidelines: isolation (unit tests should exercise only a single unit) and separation (they should be placed next to this unit). However, practice shows that recovery may be challenging because the guidelines typically cannot be fully followed. Furthermore, previous works have already demonstrated that fully automatic test-to-code traceability recovery for unit tests is virtually impossible in a general case. In this work, we propose a semi-automatic method for this task, which is based on computing traceability links using static and dynamic approaches, comparing their results and presenting the discrepancies to the user, who will determine the final traceability links based on the differences and contextual information. We define a set of discrepancy patterns, which can help the user in this task. Additional outcomes of analyzing the discrepancies are structural unit testing issues and related refactoring suggestions. For the static test-to-code traceability, we rely on the physical code structure, while for the dynamic, we use code coverage information. In both cases, we compute combined test and code clusters which represent sets of mutually traceable elements. We also present an empirical study of the method involving 8 non-trivial open source Java systems.

关键词： Test-to-code traceability Traceability link recovery Unit testing code coverage Structural test smells Refactoring

来源：评论

学校读者我要写书评

暂无评论

An empirical study on the effects of code visibility on program testability

引用

SOFTWARE QUALITY JOURNAL 2017年第3期25卷 951-978页

作者： Ma, Lei Zhang, Cheng Yu, Bing Sato, Hiroyuki Harbin Inst Technol Harbin Peoples R China Univ Waterloo Waterloo ON Canada Waseda Univ Tokyo Japan Univ Tokyo Tokyo Japan

Software testability represents the degree of ease with which a software artifact supports testing. When it is easy to detect defects in a program through testing, the program has high testability;otherwise, the testability of the program is low. As an abstract property of programs, testability can be measured by various metrics, which are affected by different factors of design and implementation. In object-oriented software development, code visibility is important to support design principles, such as information hiding. It is widely believed that code visibility has some effects on testability. However, little empirical evidence has been shown to clarify whether and how software testability is influenced by code visibility. We have performed a comprehensive empirical study to shed light on this problem. We first use code coverage as a concrete proxy for testability. We select 27 real-world software programs as subjects and ran two state-of-the-art automated testing tools, Randoop and EvoSuite, on these programs to analyze their code coverage, in comparison with that of developer-written tests. The results show that code visibility does not necessarily have effects on code coverage, but can significantly affect automated tools. Developer-written tests achieve similar coverage on code areas with different visibility, while low code visibility often leads to low code coverage for automated tools. In addition, we have developed two enhanced variants of Randoop that implement multiple strategies to handle code visibility. The results on Randoop variants show that different treatments on code visibility can result in significant differences in code coverage for automated tools. In the second part, our study uses fault detection rate as another concrete measurement of testability. We apply the automated testing tools on 357 real faults. The result of our in-depth analysis is consistent with that of the first part, demonstrating the significant effects of code visibilit

关键词： Software testing Software testability Automated testing code coverage code visibility code accessibility Fault detection

来源：评论

学校读者我要写书评

暂无评论

Higher accuracy and lower run time: efficient mutation analysis using non-redundant mutation operators

引用

SOFTWARE TESTING VERIFICATION & RELIABILITY 2015年第5-7期25卷 490-507页

作者： Just, Rene Schweiggert, Franz Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA Univ Ulm Dept Appl Informat Proc D-89069 Ulm Germany

Mutation analysis is a powerful but computationally expensive method to measure the effectiveness of a testing or debugging technique. The high cost is due, in part, to redundant mutants generated by commonly used mutation operators. A mutant is said to be redundant if its outcome can be predicted based on the outcome of other mutants. The execution of those redundant mutants is unnecessary and wastes CPU resources. Moreover, the inclusion of redundant mutants may lead to a skewed mutant detection rate and therefore misrepresent the effectiveness of the assessed testing or debugging technique. This paper extends previous work and makes the following contributions. First, it defines and provides non-redundant versions of the conditional operator replacement, unary operator insertion, and relational operator replacement mutation operators. Second, it reports on a conducted empirical study using 10 real-world programmes that comprise a total of 410000 lines of code. The empirical study used developer-written and generated test suites. The results show how prevalent redundant mutants are and how their elimination improves the efficiency and accuracy of mutation analysis. In summary, the total mutation analysis run time decreased by more than 20% by removing redundant mutants, and the inclusion of redundant mutants led to an overestimated mutation score for all analysed test suites. Copyright (C) 2014 John Wiley & Sons, Ltd.

关键词： mutation analysis redundant mutants test adequacy code coverage

来源：评论

学校读者我要写书评

暂无评论

File Systems are Hard to Test - Learning from Xfstests

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2019年第2期E102D卷 269-279页

作者： Aota, Naohiro Kono, Kenji Keio Univ Yokohama Kanagawa 2238522 Japan

Modern file systems, such as ext4, btrfs, and XFS, are evolving and enable the introduction of new features to meet ever-changing demands and improve reliability. File system developers are struggling to eliminate all software bugs, but the operating system community points out that file systems are a hotbed of critical software bugs. This paper analyzes the code coverage of xfstests, a widely used suite of file system tests, on three major file systems (ext4, btrfs, and XFS). The coverage is 72.34%, and the uncovered code runs into 23,232 lines of code. To understand why the code coverage is low, the uncovered code is manually examined line by line. We identified three major causes, peculiar to file systems, that hinder higher coverage. First, covering all the features is difficult because each file system provides a wide variety of file-system specific features, and some features can be tested only on special storage devices. Second, covering all the execution paths is difficult because they depend on file system configurations and internal on-disk states. Finally, the code for maintaining backward-compatibility is executed only when a file system encounters old formats. Our findings will help file system developers improve the coverage of test suites and provide insights into fostering the development of new methodologies for testing file systems.

关键词： file system code coverage software test

来源：评论

学校读者我要写书评

暂无评论

Research on software regression testing method considering greedy algorithm sorting weight

引用

INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION 2024年第1期24卷 55-64页

作者： Wang, Weibin Xian Fanyi Univ Sch Informat Engn Xian 710105 Peoples R China

A regression testing algorithm based on greedy algorithm sorting weight is proposed to further improve the efficiency and effectiveness of software regression test. In view of the problems existing in the sorting of test cases of two greedy algorithms, a weight-based sorting strategy is proposed to further improve the rate and effectiveness of software testing. Simulation results show that compared with global greedy algorithm and additional greedy algorithm, the weight-based regression test prioritisation algorithm can improve the effectiveness of test results while ensuring shorter execution time and it has higher APFD values and better performance. Therefore, the weight-based regression software test prioritisation algorithm designed can improve the effectiveness of software program testing, and can be applied to the regression testing of software, with high feasibility.

关键词： software testing regression testing sorting algorithm code coverage

来源：评论

学校读者我要写书评

暂无评论

PosFuzz:augmenting greybox fuzzing with effective position distribution

引用

Cybersecurity 2023年第4期6卷 123-143页

作者： Yanyan Zou Wei Zou JiaCheng Zhao Nanyu Zhong Yu Zhang Ji Shi Wei Huo Institute of Information Engineering Chinese Academy of SciencesBeijingChina School of Cyber Security University of Chinese Academy of SciencesBeijingChina State Key Lab of Processors Institute of Computing TechnologyChinese Academy of SciencesBeijingChina Key Laboratory of Network Assessment Technology Chinese Academy of SciencesBeijingChina Beijing Key Laboratory of Network Security and Protection Technology BeijingChina Zhongguancun Laboratory BeijingChina

Mutation-based greybox fuzzing has been one of the most prevalent techniques for security vulnerability discovery and a great deal of research work has been proposed to improve both its efficiency and ***-based greybox fuzzing generates input cases by mutating the input seed,i.e.,applying a sequence of mutation operators to randomly selected mutation positions of the ***,existing fruitful research work focuses on scheduling mutation operators,leaving the schedule of mutation positions as an overlooked aspect of fuzzing *** paper proposes a novel greybox fuzzing method,PosFuzz,that statistically schedules mutation positions based on their historical *** makes use of a concept of effective position distribution to represent the semantics of the input and to guide the *** first utilizes Good-Turing frequency estimation to calculate an effective position distribution for each mutation *** then leverages two sampling methods in different mutating stages to select the positions from the *** have implemented PosFuzz on top of AFL,AFLFast and MOPT,called Pos-AFL,-AFLFast and-MOPT respectively,and evaluated them on the UNIFUZZ benchmark(20 widely used open source programs)and LAVA-M *** result shows that,under the same testing time budget,the Pos-AFL,-AFLFast and-MOPT outperform their counterparts in code coverage and vulnerability discovery *** with AFL,AFLFast,and MOPT,PosFuzz gets 21%more edge coverage and finds 133%more paths on *** also triggers 275%more unique bugs on average.

关键词： Greybox fuzzing Mutation position Mutation operator code coverage Vulnerability discovery

来源：评论

学校读者我要写书评

暂无评论

Generating software test data by evolution

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2001年第12期27卷 1085-1110页

作者： Michael, CC McGraw, G Schatz, MA Cigital Corp Dulles VA 20166 USA

This paper discusses the use of genetic algorithms (GAs) for automatic software test data generation. This research extends previous work on dynamic test data generation where the problem of test data generation is reduced to one of minimizing a function [1], [2]. In our work, the function is minimized by using one of two genetic algorithms in place of the local minimization techniques used in earlier research. We describe the implementation of our GA-based system and examine the effectiveness of this approach on a number of programs, one of which is significantly larger than those for which results have previously been reported in the literature. We also examine the effect of program complexity on the test data generation problem by executing our system on a number of synthetic programs that have varying complexities.

关键词： software testing automatic test case generation code coverage genetic algorithms combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of a dynamic symbolic execution tool for windows executables

引用

JOURNAL OF SOFTWARE-EVOLUTION AND PROCESS 2013年第12期25卷 1249-1272页

作者： Chen, Ting Zhang, Xiao-song Zhu, Cong Ji, Xiao-li Guo, Shi-ze Wu, Yue Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Peoples R China Inst North Elect Equipment Beijing 100191 Peoples R China

Dynamic symbolic execution, or DSE for short, has become a promising technique in software testing. However, the implementation details of DSE have not been described in depth in existing works. Although some open-source DSE tools are available nowadays, to design and implement a specific DSE tool from scratch is necessary for some reasons. To this end, we implement a Smart Fuzzing Tool for Windows Native Executables, or SMAFE for short, which utilizes Pin and STP for instrumentation and constraint solving, respectively. Advantages of Pin and STP make SMAFE portable. The major contribution of this paper is our detailed description of the implementation of DSE, including symbolization of inputs, tracking of symbols, synchronization of overlapped symbols, environment modeling, and so on. A practical case study validates the effectiveness of SMAFE. Then, the experiments with two benchmark sets present that the code coverage is above 90% on average. Benefits from this paper are at least twofold: moderating learning curve for scholars and shortening the development circle for practitioners. Copyright (c) 2013 John Wiley & Sons, Ltd.

关键词： software testing automated test generation dynamic symbolic execution implementations code coverage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：