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

17th IEEE International Conference on Software Testing, Verification, and Validation (ICST)

作者： Nilizadeh, Amirfarhad Leavens, Gary T. Pasareanu, Corina S. Le, Xuan-Bach D. Cok, David R. Univ Cent Florida Orlando FL 32816 USA Carnegie Mellon Univ Moffett Field CA USA NASA Ames Res Ctr Moffett Field CA 94035 USA Univ Melbourne Melbourne Vic Australia Safer Software Consulting LLC Rochester NY USA

ISBN: (纸本)9798350308198;9798350308181

Automated program repair (APR) tools generally use a test suite to localize bugs and validate patches. These patches may pass the test suite but still be incorrect, which is called overfitting. To better understand the relationship between code coverage and overfitting, we aim to quantify the reduction in overfitting achieved by having more tests to cover branches multiple times, once 100% branch coverage is reached. We also investigate whether having more such tests increases the chances that the generated patch is exact, meaning that the patched program is syntactically the same as the original, high quality correct code in our dataset. Our experiments used three different test suites, each covering all branches in the code: test suites that cover each branch at least 1, 3, or 5 times. We used seven well-known APR tools for Java on a dataset of buggy programs equipped with formal specifications. Using formal methods allows us to reliably and objectively check for overfitting. Our experimental results indicate that enlarging the test suite beyond 100% coverage of branches reduces overfitting. However, beyond a certain threshold, expanding the test suite to cover branches repeatedly does not reduce overfitting.

关键词： Automated Program Repair Software Testing Overfitting branch coverage Formal Methods

来源：评论

学校读者我要写书评

暂无评论

Towards Agile Mutation Testing Using branch coverage Based Prioritization Technique 6th

Towards Agile Mutation Testing Using Branch Coverage Based P...

引用

6th International Conference on Lean and Agile Software Development (LASD)

作者： Godboley, Sangharatna Mohapatra, Durga Prasad Natl Inst Technol Warangal Warangal Andhra Pradesh India Natl Inst Technol Rourkela Rourkela India

ISBN: (纸本)9783030942380;9783030942373

The agile model is the present reality for any software development process. Its main objective is to produce good quality software in optimal time. Programmers do unit testing to ensure that the software unit or module they are developing should be bug-free and check that the module is doing what it is supposed to do. On the other hand mutation testing is an important technique to show that the quality of test cases is good. But, industrial practitioners do not follow it in practice because of the computational expenses and huge amount of effort required. In this paper, we introduce a technique to make mutation testing faster, so that the continuous integration (CI) which is the main process of agile can be performed. This way we are towards achieving principles of agile testing. We compute Line and branch coverages for a program and utilize them in mutation testing. Using Line coverage information we eliminate the Dead Mutants upfront. Next, using branch coverage information we set the priority by assigning a rank to each test case and running on reachable mutants. In this paper, we have obtained better results for 45 out of 60 Programs i.e. 75%. Experimentally, we show that our proposed prioritization approach consumes approx. 1036 s less mutation testing time as compared to the baseline (without prioritization). Since we perform mutation testing in less time to achieve agility, we call this technique Agile Mutation Testing.

关键词： Agile mutation testing Prioritization Line coverage branch coverage

来源：评论

学校读者我要写书评

暂无评论

Towards exhaustive branch coverage with PathCrawler 2

Towards exhaustive branch coverage with PathCrawler

引用

2nd IEEE/ACM International Conference on Automation of Software Test (AST)

作者： Williams, Nicky Univ Paris Saclay LIST CEA F-91120 Palaiseau France

ISBN: (纸本)9781665435673

branch coverage of source code is a very widely used test criterion. Moreover, branch coverage is a similar problem to line coverage, MC/DC and the coverage of assertion violations, certain runtime errors and various other types of test objective. Indeed, establishing that a large number of test objectives are unreachable, or conversely, providing the test inputs which reach them, is at the heart of many verification tasks. However, automatic test generation for exhaustive branch coverage remains an elusive goal: many modern tools obtain high coverage scores without being able to provide an explanation for why some branches are not covered, such as a demonstration that they are unreachable. Concolic test generation offers the promise of exhaustive coverage but covers paths more efficiently than branches. In this paper, I explain why, and propose different strategies to improve its performance on exhaustive branch coverage. A comparison of these strategies on examples of real code shows promising results.

关键词： automatic test generation branch coverage reachability concolic

来源：评论

学校读者我要写书评

暂无评论

Using a Guided Fuzzer and Preconditions to Achieve branch coverage with Valid Inputs 15th

Using a Guided Fuzzer and Preconditions to Achieve Branch Co...

引用

15th International Conference on Tests and Proofs (TAP) Held as Part of Software Technologies - Applications and Foundations (STAF) Conference

作者： Nilizadeh, Amirfarhad Leavens, Gary T. Pasareanu, Corina S. Univ Cent Florida Orlando FL 32816 USA Carnegie Mellon Univ NASA Ames Res Ctr Moffett Field CA USA

ISBN: (纸本)9783030793791;9783030793784

Software is widely used in critical systems. Thus, it is important that developers can quickly find semantic bugs with testing;however, semantic bugs can only be revealed by tests that use valid inputs. Guided fuzzers can create input tests that cover all branches;however, they may not necessarily cover all branches with valid inputs. Therefore, the problem is how to guide a fuzzer to cover all branches in a program with only valid inputs. We perform a study of an idea that guarantees that all inputs generated by a guided fuzzer that reach the program under test are valid using formal specifications and runtime assertion checking. Our results show that this idea improves the feedback given to a guided fuzzer.

关键词： Guided fuzzing Testing branch coverage Valid inputs Formal methods Runtime assertion checking

来源：评论

学校读者我要写书评

暂无评论

Comparing mutation coverage against branch coverage in an industrial setting

引用

INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER 2020年第4期22卷 365-388页

作者： Parsai, Ali Demeyer, Serge Univ Antwerp Middelheimlaan 1 B-2020 Antwerp Belgium Flanders Make Middelheimlaan 1 B-2020 Antwerp Belgium

The state-of-the-practice in software development is driven by constant change fueled by continues integration servers. Such constant change demands for frequent and fully automated tests capable to detect faults immediately upon project build. As the fault detection capability of the test suite becomes so important, modern software development teams continuously monitor the quality of the test suite as well. However, it appears that the state-of-the-practice is reluctant to adopt strong coverage metrics (namely mutation coverage), instead relying on weaker kinds of coverage (namely branch coverage). In this paper, we investigate three reasons that prohibit the adoption of mutation coverage in a continuous integration setting: (1) the difficulty of its integration into the build system, (2) the perception that branch coverage is "good enough", and (3) the performance overhead during the build. Our investigation is based on a case study involving four open source systems and one industrial system. We demonstrate that mutation coverage reveals additional weaknesses in the test suite compared to branch coverage and that it is able to do so with an acceptable performance overhead during project build.

关键词： Software Testing Mutation Testing branch coverage Continuous Integration Industrial Setting

来源：评论

学校读者我要写书评

暂无评论

To Call, or Not to Call: Contrasting Direct and Indirect branch coverage in Test Generation 11

To Call, or Not to Call: Contrasting Direct and Indirect Bra...

引用

11th IEEE/ACM International Workshop on Search-Based Software Testing (SBST)

作者： Gay, Gregory Univ South Carolina Columbia SC 29208 USA

ISBN: (纸本)9781450357418

While adequacy criteria offer an end-point for testing, they do not mandate how targets are covered. branch coverage may be attained through direct calls to methods, or through indirect calls between methods. Automated generation is biased towards the rapid gains offered by indirect coverage. Therefore, even with the same end-goal, humans and automation produce very different tests. Direct coverage may yield tests that are more understandable, and that detect faults missed by traditional approaches. However, the added burden for the generation framework may result in lower coverage and faults that emerge through method interactions may be missed. To compare the two approaches, we have generated test suites for both, judging efficacy against real faults. We have found that requiring direct coverage results in lower achieved coverage and likelihood of fault detection. However, both forms of branch coverage cover code and detect faults that the other does not. By isolating methods, Direct branch coverage is less constrained in the choice of input. However, traditional branch coverage is able to leverage method interactions to discover faults. Ultimately, both are situationally applicable within the context of a broader testing strategy.

关键词： Adequacy Criteria Automated Test Generation branch coverage

来源：评论

学校读者我要写书评

暂无评论

An Automated Analysis of the branch coverage and Energy Consumption Using Concolic Testing

引用

ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING 2017年第2期42卷 619-637页

作者： Godboley, Sangharatna Panda, Subhrakanta Dutta, Arpita Mohapatra, Durga Prasad Natl Inst Technol Dept Comp Sci & Engn Rourkela India

The energy consumption of computer systems has become an important economic and environmental issue. Many researchers have focused on the energy consumption of hardware, but what about the software? Software energy consumption is widely adopted for Green computation of practical experimentation in research laboratories. But current researchers fail to build a consistent concept base for software energy consumption of critical applications. While branch coverage and concolic testing are very critical practices to validate the safety critical systems, very little effort is given to measure their energy consumption. The computation of the energy consumption of these techniques is an important issue in Green IT and Green Software Engineering. The contribution of this paper is to automate the computation and analysis of the energy consumption of the testing technique while enhancing the branch coverage using concolic testing. We implement our proposed automation framework in a tool, named Green Analysis of branch coverage Enhancement. The empirical study with forty Java programs and the evaluation results show that our developed tool achieves an average increase of 13.5 % in branch coverage. The average energy consumption of our automated tool is approximately 5.6 kJ to compute the branch coverage for all the forty experimental programs.

关键词： branch coverage Concolic testing Energy consumption Green IT Green Software Engineering Green and sustainable technologies

来源：评论

学校读者我要写书评

暂无评论

Effective Testcase Retaining Using branch coverage Technique 2

Effective Testcase Retaining Using Branch Coverage Technique

引用

2nd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)

作者： Velmurugan, P. Mahapatra, Rajendra Prasad SRM Univ Dept Comp Sci & Engg NCR Campus Ghaziabad Uttar Pradesh India

ISBN: (纸本)9781509023998

This present research seeks to address the issue of test case optimization in software testing by reducing the number of test cases required, through traditional methods. This is achieved through regression testing for test case reduction and branch selection for maximum coverage. This research uses one of the traditional methods for testcase reduction and new technique to retain some testcases from the rejected test suite, generated by traditional method. This approach uses branch coverage technique to retain the test cases from reduced test suite. The proposed technique will improve effectiveness of software testing through branch coverage. Finally, this research the proposed methodology is expected to be more effective for regression testing.

关键词： Software Testing test case generation test case reduction branch coverage

来源：评论

学校读者我要写书评

暂无评论

Reformulating branch coverage as a Many-Objective Optimization Problem 8

Reformulating Branch Coverage as a Many-Objective Optimizati...

引用

8th IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)

作者： Panichella, Annibale Kifetew, Fitsum Meshesha Tonella, Paolo Delft Univ Technol NL-2600 AA Delft Netherlands Univ Trento Trento Italy Fdn Bruno Kessler Trento Italy

ISBN: (纸本)9781479971251

Test data generation has been extensively investigated as a search problem, where the search goal is to maximize the number of covered program elements (e.g., branches). Recently, the whole suite approach, which combines the fitness functions of single branches into an aggregate, test suite-level fitness, has been demonstrated to be superior to the traditional single-branch at a time approach. In this paper, we propose to consider branch coverage directly as a many-objective optimization problem, instead of aggregating multiple objectives into a single value, as in the whole suite approach. Since programs may have hundreds of branches (objectives), traditional many-objective algorithms that are designed for numerical optimization problems with less than 15 objectives are not applicable. Hence, we introduce a novel highly scalable many-objective genetic algorithm, called MOSA (Many-Objective Sorting Algorithm), suitably defined for the many-objective branch coverage problem. Results achieved on 64 Java classes indicate that the proposed many-objective algorithm is significantly more effective and more efficient than the whole suite approach. In particular, effectiveness (coverage) was significantly improved in 66% of the subjects and efficiency (search budget consumed) was improved in 62% of the subjects on which effectiveness remains the same.

关键词： Evolutionary testing many-objective optimization branch coverage

来源：评论

学校读者我要写书评

暂无评论

ABCE: A novel framework for Improved branch coverage Analysis

ABCE: A novel framework for Improved Branch Coverage Analysi...

引用

International Conference on Soft Computing and Software Engineering (SCSE)

作者： Godboley, Sangharatna Sahani, Arun Mohapatra, Durga Prasad NIT Rourkela DOS Lab Rourkela Odisha India

The software testing practices generate test cases manually, that affects both the effectiveness and efficiency. In aerospace and safety critical domains, software quality assurance is strict to rules and regulations such as DO-178B standard. To resolve these issues, concolic testing generates test suite that can attain high coverage using an automated technique based on branch coverage. In this paper, we propose a framework to compute branch coverage percentage for test case generation. To achieve an increase in branch coverage, we transform the input Java program, P, into its transformed version, P', using JPCT. Then we use JCUTE to generate test cases and find branch coverage percentage. Our experimental studies on branch coverage percentage consists of two steps: the first observation is made without using Java program code transformer, the second observation is made by using Java program code transformer. The Java program code transformer adds additional conditional statements for each decision that causes variation in branch coverage. We quantify this variation in the form of branch coverage percentage. This approach resolves some of the bottleneck issues associated with traditional concolic testers. The experimental studies show that our approach achieves 20.146 % of average increase in branch coverage. This increase in branch coverage percentage is achieved in an average computation time of 33837.6 milli seconds. (C) 2015 The Authors. Published by Elsevier B.V.

关键词： Software Testing branch coverage JPCT JCUTE

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：