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

Fault localization based on information flow coverage

SOFTWARE TESTING VERIFICATION & RELIABILITY 2010年第2期20卷 121-147页

作者： Masri, Wes Amer Univ Beirut Dept Elect & Comp Engn Beirut 11072020 Lebanon

Failures triggered by hard to debug defects usually involve complex interactions between many program elements. This paper hypothesizes that information flows present a good model for such interactions and presents a new fault localization technique based on information flow coverage. Using a test suite, the technique ranks the statements in a program in terms of their likelihood of being faulty by comparing the information flows induced by the failing runs with the ones induced by the passing runs. The ranking of the statements associated with a given flow is primarily determined by contrasting the percentage of failing runs to the percentage of passing runs that induced it. Generally, a higher percentage of failing runs implies a higher rank. To show its potential, the technique was applied to several open-source Java programs and was compared, with respect to its fault localization effectiveness, with three other coverage techniques that use similar style metrics that are defined for statements, branches, and defuse pairs, respectively. The results revealed that information flow, branch, and defuse coverage performed consistently better than statement coverage. In addition, in a considerable number of cases information flow coverage performed better than branch and defuse coverage. Specifically, it was always safer but not always more precise. Copyright (C) 2009 John Wiley & Sons, Ltd.

关键词： fault localization debugging dynamic information flow analysis information flow coverage statement coverage branch coverage def-use coverage

来源：评论

学校读者我要写书评

暂无评论

On guiding the augmentation of an automated test suite via mutation analysis

引用

EMPIRICAL SOFTWARE ENGINEERING 2009年第3期14卷 341-369页

作者： Smith, Ben H. Williams, Laurie N Carolina State Univ Dept Comp Sci Raleigh NC 27695 USA

Mutation testing has traditionally been used as a defect injection technique to assess the effectiveness of a test suite as represented by a "mutation score." Recently, mutation testing tools have become more efficient, and industrial usage of mutation analysis is experiencing growth. Mutation analysis entails adding or modifying test cases until the test suite is sufficient to detect as many mutants as possible and the mutation score is satisfactory. The augmented test suite resulting from mutation analysis may reveal latent faults and provides a stronger test suite to detect future errors which might be injected. Software engineers often look for guidance on how to augment their test suite using information provided by line and/or branch coverage tools. As the use of mutation analysis grows, software engineers will want to know how the emerging technique compares with and/or complements coverage analysis for guiding the augmentation of an automated test suite. Additionally, software engineers can benefit from an enhanced understanding of efficient mutation analysis techniques. To address these needs for additional information about mutation analysis, we conducted an empirical study of the use of mutation analysis on two open source projects. Our results indicate that a focused effort on increasing mutation score leads to a corresponding increase in line and branch coverage to the point that line coverage, branch coverage and mutation score reach a maximum but leave some types of code structures uncovered. Mutation analysis guides the creation of additional "common programmer error" tests beyond those written to increase line and branch coverage. We also found that 74% of our chosen set of mutation operators is useful, on average, for producing new tests. The remaining 26% of mutation operators did not produce new test cases because their mutants were immediately detected by the initial test suite, indirectly detected by test suites we added to detect other mutants

关键词： Mutation testing Line coverage Fault injection Empirical effectiveness Test case augmentation Mutation analysis Mutation testing tool statement coverage Test adequacy Web application Open source Unit testing

来源：评论

学校读者我要写书评

暂无评论

Ant Colony System With Sorting-Based Local Search for coverage-Based Test Case Prioritization

引用

IEEE TRANSACTIONS ON RELIABILITY 2020年第3期69卷 1004-1020页

作者： Lu, Chengyu Zhong, Jinghui Xue, Yinxing Feng, Liang Zhang, Jun South China Univ Technol Sch Comp Sci & Engn Comp Sci Guangzhou 510006 Peoples R China South China Univ Technol Sch Comp Sci & Engn Guangzhou 510006 Peoples R China Univ Sci & Technol China Sch Comp Sci & Technol Hefei 230027 Peoples R China Chongqing Univ Sch Comp Sci Chongqing 400044 Peoples R China Victoria Univ Melbourne Vic 8001 Australia

Test case prioritization (TCP) is a popular regression testing technique in software engineering field. The task of TCP is to schedule the execution order of test cases so that certain objective (e.g., code coverage) can be achieved quickly. In this article, we propose an efficient ant colony system framework for the TCP problem, with the aim of maximizing the code coverage as soon as possible. In the proposed framework, an effective heuristic function is proposed to guide the ants to construct solutions based on additional statement coverage among remaining test cases. Besides, a sorting-based local search mechanism is proposed to further accelerate the convergence speed of the algorithm. Experimental results on different benchmark problems, and a real-world application, have shown that the proposed framework can outperform several state-of-the-art methods, in terms of solution quality and search efficiency.

关键词： Search problems Testing Software engineering Computer science Stochastic processes Graphics processing units Ant colony system (ACS) regression testing statement coverage test case prioritization (TCP)

来源：评论

学校读者我要写书评

暂无评论

Reducing scheduling sequences of message-passing parallel programs

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2016年 80卷 217-230页

作者： Gong, Dunwei Zhang, Chen Tian, Tian Li, Zheng China Univ Min & Technol Sch Informat & Elect Engn Xuzhou 221116 Jiangsu Peoples R China LanZhou Univ Technol Sch Elect Engn & Informat Engn Lanzhou 730000 Gansu Peoples R China Shandong Jianzhu Univ Sch Comp Sci & Technol Jinan 250101 Shandong Peoples R China Beijing Univ Chem Technol Coll Informat Sci & Technol Beijing 100029 Peoples R China

Context: Message-passing parallel programs are commonly used parallel programs. Various scheduling sequences contained in these programs, however, increase the difficulty of testing them. Therefore, reducing scheduling sequences by using appropriate approaches can greatly improve the efficiency of testing these programs. Objective: This paper focuses on the problem of reducing scheduling sequences of message-passing parallel programs, and presents a novel approach to reducing scheduling sequences. Method: In this approach, scheduling sequences that affect the target statement are first determined based on the relation between a scheduling sequence and the execution of the target statement. Then, these scheduling sequences are divided into a number of equivalent classes according to the execution of the target statement. Finally, for each scheduling sequence in the same equivalent class, the values of the two proposed indexes are calculated, and the scheduling sequence with the minimal comprehensive value is selected as the one after reduction. Results: To evaluate the performance of the proposed approach, it is applied to test 12 typical message passing parallel programs. The experimental results show that the proposed approach reduces 63% scheduling sequences on average. And compared with the method without reduction, and the method with randomly selecting scheduling sequences, the proposed approach shortens 67% and 52% execution time of a program for covering the target statement on average, respectively. Conclusion: The proposed approach can greatly reduce scheduling sequences, and shorten execution time of a program for covering the target statement, hence improving the efficiency of testing the program. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Software testing Message-passing parallel program Reduction of scheduling sequences statement coverage Equivalent class

来源：评论

学校读者我要写书评

暂无评论

Gamification to Aid the Learning of Test coverage Concepts 32

Gamification to Aid the Learning of Test Coverage Concepts

引用

32nd IEEE Conference on Software Engineering Education and Training (CSEE and T)

作者： Sherif, Eman Liu, Andy Nguyen, Brian Lerner, Sorin Griswold, William G. Univ Calif San Diego Comp Sci & Engn La Jolla CA 92093 USA

ISBN: (纸本)9781728168074

The ability to effectively and efficiently test software is an important practice in software testing that is often under-emphasized in computer science education. Many students find learning about testing to be uninteresting and difficult to learn. This causes numerous students to develop inadequate testing habits, which can be detrimental to their professional careers. To encourage students to develop better testing habits, we used gamification to make the learning experience more engaging and enjoyable. In this paper we explore this idea by integrating gamification and statement coverage into a turn-based game called CoverBot. To test the effectiveness of CoverBot with respect to both teaching statement coverage and increasing engagement and enjoyment, we conducted a user study. We found that gamification makes the learning about statement coverage more engaging and enjoyable while also enhancing the participants performance and understanding of statement coverage.

关键词： Computer-aided instruction gamification software testing statement coverage

来源：评论

学校读者我要写书评

暂无评论

NEAT Algorithm for Testsuite generation in Automated Software Testing 8

NEAT Algorithm for Testsuite generation in Automated Softwar...

引用

8th IEEE Symposium Series on Computational Intelligence (IEEE SSCI)

作者： Raj, H. L. Praveen Chandrasekaran, K. Natl Inst Technol Karnataka Surathkal Dept Comp Sci & Engn Mangalore India

ISBN: (纸本)9781538692769

Software testing is one of the most essential and an indispensable part of Software production life cycle. Software testing helps in validating if the product meets with the requirements or not, and also testing helps to validate the performance of the product. Unfortunately, this process takes up about 50% of the production time and budget, due to its laboriosity. Hence, in order to reduce the time it takes, Automated Software Testing becomes essential. Here we propose a novel idea of using Machine Learning for automatically generating the test suites. In this paper we present an approach that uses NEAT (Neuroevolution of Augmenting Topologies) Algorithm to automatically generate new test suites or for improving the coverage of already produced test suite. Our approach automatically generates test suites for white box testing. White box testing refers to testing of the internal structure and the working of the Software Under Test.

关键词： Genetic Algorithm NEAT Algorithm Machine Learning Software testing statement coverage branch coverage loop coverage Software Under Test

来源：评论

学校读者我要写书评

暂无评论

Software Testing Method Based on Improved Simulated Annealing Algorithm 10

Software Testing Method Based on Improved Simulated Annealin...

引用

10th International Conference on Reliability Maintainability and Safety

作者： Wang, Kun Wang, Yichen Zhang, Liyan Beihang Univ BUAA Sch Reliabil & Syst Engn Beijing Peoples R China Special Police Coll CAPF Beijing Peoples R China

ISBN: (纸本)9781479966325

This paper presents a software testing method based on the improved simulated annealing algorithm. The main idea of the method is to test the variation program through the program mutation and injecting the known defects into the program under test. By discovering the known defects in programs, we tend to find unknown defects in the original program. The method mainly includes four parts: process variation, designing the initial test case set, using intelligent algorithms to generate test cases and testing adequacy criteria based on the coverage. The core of software testing is to generate test cases automatically. Therefore the simulated annealing intelligent algorithm proposed in this paper will discriminate the sufficiency basing on defect coverage and statement coverage, to ensure the efficiency of test case generation.

关键词： Simulated Annealing Algorithm (SAA) process variation test case generation defect coverage statement coverage

来源：评论

学校读者我要写书评

暂无评论

Enabling coverage-Based Verification in Chisel 27

Enabling Coverage-Based Verification in Chisel

引用

27th IEEE European Test Symposium (ETS)

作者： Dobis, Andrew Damsgaard, Hans Jakob Tolotto, Enrico Hesse, Kasper Petersen, Tjark Schoeberl, Martin Tech Univ Denmark Dept Appl Math & Comp Sci Lyngby Denmark

ISBN: (纸本)9781665467063

Ever-increasing performance demands are pushing hardware designers towards designing domain-specific accelerators. This has created a demand for improving the overall efficiency of the hardware design and verification cycles. The design efficiency was improved with the introduction of Chisel. However, verification efficiency has yet to be tackled. One method that can increase verification efficiency is the use of various types of coverage measures. In this paper, we present our opensource, coverage-related verification tools targeting digital designs described in Chisel. Specifically, we have created a new method allowing for statement coverage at an intermediate representation of Chisel, and several methods for gathering functional coverage directly on a Chisel description.

关键词： Hardware Verification statement coverage Functional coverage Chisel Scala

来源：评论

学校读者我要写书评

暂无评论

A Framework for Cost-Effective Dependence-Based Dynamic Impact Analysis 22

A Framework for Cost-Effective Dependence-Based Dynamic Impa...

引用

22nd IEEE International Conference on Software Analysis, Evolution, and Reengineering (SANER)

作者： Cai, Haipeng Santelices, Raul Univ Notre Dame Notre Dame IN 46556 USA

ISBN: (纸本)9781479984695

Dynamic impact analysis can greatly assist developers with managing software changes by focusing their attention on the effects of potential changes relative to concrete program executions. While dependence-based dynamic impact analysis (DDIA) provides finer-grained results than traceability-based approaches, traditional DDIA techniques often produce imprecise results, incurring excessive costs thus hindering their adoption in many practical situations. In this paper, we present the design and evaluation of a DDIA framework and its three new instances that offer not only much more precise impact sets but also flexible cost-effectiveness options to meet diverse application needs such as different budgets and levels of detail of results. By exploiting both static dependencies and various dynamic information including method-execution traces, statement coverage, and dynamic points-to data, our techniques achieve that goal at reasonable costs according to our experiment results. Our study also suggests that statement coverage has generally stronger effects on the precision and cost-effectiveness of DDIA than dynamic points-to data.

关键词： Dependence analysis dynamic impact analysis statement coverage dynamic points-to cost-effectiveness

来源：评论

学校读者我要写书评

暂无评论

Total fault exposing potential based test case prioritization using genetic algorithm

引用

International Journal of Information Technology (Singapore) 2019年第4期11卷 633-637页

作者： Mishra, Deepti Bala Panda, Namita Mishra, Rajashree Acharya, Arup Abhinna School of Computer Engineering KIIT University Bhubaneswar 751024 India School of Applied Sciences KIIT University Bhubaneswar 751024 India

The quality of modified software depends on selecting an efficient technique of Regression testing, in which the test cases are selected based on how fast the mutants are detected. The process of executing the most beneficial test case is called as test case prioritization. The redundant test cases which detect the same mutants can be eliminated for minimization, which results in reducing the cost and time of regression testing. This paper presents a code based prioritization technique in which total statement coverage, total fault exposing potential award and total mutant coverage is taken as prioritization factors to prioritize test cases for software under test. In the proposed method, Genetic Algorithm is used for prioritization and further test cases are minimized based on total mutant coverage. The effectiveness of the prioritized order is measured by Average Percentage of statement coverage metric. © 2018, Bharati Vidyapeeth's Institute of Computer Applications and Management.

关键词： APSC Fault exposing potential (FEP) Genetic algorithm Software test case statement coverage Test case prioritization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：