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

A family of code coverage-based heuristics for effective fault localization

JOURNAL OF SYSTEMS AND SOFTWARE 2010年第2期83卷 188-208页

作者： Wong, W. Eric Debroy, Vidroha Choi, Byoungju Univ Texas Dallas Dept Comp Sci Dallas TX 75083 USA Ewha Womans Univ Dept Comp Sci & Engn Seoul South Korea

Locating faults in a program can be very time-consuming and arduous, and therefore, there is an increased demand for automated techniques that can assist in the fault localization process. In this paper a code coverage-based method with a family of heuristics is proposed in order to prioritize suspicious code according to its likelihood of containing program bugs. Highly suspicious code (i.e., code that is more likely to contain a bug) should be examined before code that is relatively less suspicious;and in this manner programmers can identify and repair faulty code more efficiently and effectively. We also address two important issues: first, how can each additional failed test case aid in locating program faults;and second, how can each additional successful test case help in locating program faults. We propose that with respect to a piece of code, the contribution of the first failed test case that executes it in computing its likelihood of containing a bug is larger than or equal to that of the second failed test case that executes it, which in turn is larger than or equal to that of the third failed test case that executes it, and so on. This principle is also applied to the contribution provided by successful test cases that execute the piece of code. A tool, chi Debug, was implemented to automate the computation of the suspiciousness of the code and the subsequent prioritization of suspicious code for locating program faults. To validate our method case studies were performed on six sets of programs: Siemens suite, Unix suite, space, grep, gzip, and make. Data collected from the studies are supportive of the above claim and also suggest Heuristics III(a), (b) and (c) of our method can effectively reduce the effort spent on fault localization. (C) 2009 Elsevier Inc. All rights reserved.

关键词： Fault localization Program debugging code coverage Heuristics Suspiciousness of code Successful tests Failed tests

来源：评论

学校读者我要写书评

暂无评论

Comparison Study of Optimized Test Suite Generation Using Genetic and Memetic Algorithm

Comparison Study of Optimized Test Suite Generation Using Ge...

引用

International Conference on Pervasive Computing (ICPC)

作者： Mundade, Ankita A. Pattewar, Tareek M. NMU SESs RC Patel Inst Technol Dept Comp Engn Shirpur MS India NMU SESs RC Patel Inst Technol Dept Informat Technol Shirpur MS India

ISBN: (纸本)9781479962723

Testing is one of the important phase of software engineering field, which checks the correctness of software. A common part in software testing is that test data are generated. For this test data, tester manually adds different test cases. But adding test cases manually is very difficult task. So we generate set of test cases called as test suite. Test case is nothing but a condition which we want to check. code coverage is important factor in test suite. While generating a test suite, consider a inheritance tree a of class and generate test cases by considering all branches of that tree. Test case may have more than one goal, check feasibility for this particular goal. For generating optimized test suite, apply Genetic and Memetic algorithm. The aim of this test suite generation is covering all branches for maximum code coverage while keeping the minimum size. Applying both algorithms for code coverage. code coverage of Memetic algorithm is maximum than code coverage of Genetic algorithm. We have implemented this system and for checking result use open source project such as Roops and net.

关键词： Software testing test suite Genetic algorithm Memetic algorithm code coverage

来源：评论

学校读者我要写书评

暂无评论

Test Suite Generation using Memetic Algorithm on Adaptive Local Search

Test Suite Generation using Memetic Algorithm on Adaptive Lo...

引用

2015 International Conference on Communications and Signal Processing (ICCSP)

作者： Mundade, Ankita A. Pattewar, T. M. North Maharashtra Univ Dept Comp Engn RCPTT Shirpur India North Maharashtra Univ Dept Informat Technol RCPTT Shirpur India

ISBN: (纸本)9781479980819

Testing is the process of evaluating quality and correctness of software. In testing, we always check different functions of application. Test cases are the measure component, which is required in testing the functions and conditions. Test case is nothing but a condition which we want to check. It is very difficult to add test cases manually, so that we generate set of test cases called Test Suite. To generate the test suite with high code coverage we apply Memetic algorithm. code coverage is not only important factor in test suite but also measuring part of test suite. code coverage measure used to describe the degree of source code program which is tested. Test case may have more than one goal so that we can check feasibility of particular goal. We have implement Memetic algorithm to find code coverage. Here we also applied Memetic algorithm on adaptive local search. In the evaluation it is found that code coverage of Memetic algorithm on adaptive local search is maximum than Memetic algorithm.

关键词： code coverage Memtic Algorithm Software testing Test suite

来源：评论

学校读者我要写书评

暂无评论

'Dump what you need' - A coverage Methodology to accelerate SoC Verification 15

'Dump what you need' - A Coverage Methodology to accelerate ...

引用

15th International Microprocessor Test and Verification Workshop (MTV)

作者： Venkatakrishnan, Ganesh Kadali, Naresh Kumar Open Silicon Res Pvt Ltd Pune Maharashtra India

ISBN: (纸本)9781467368582

code coverage is a method used to gauge the effectiveness of a Test setup for a particular Design. Even with the advent of modern techniques like Functional coverage, code coverage still remains an important cog in the wheel of SoC Verification cycle. Through code coverage, Design and Verification Engineers get to know about parts of code excited by the Test stimulus and more importantly, parts of code which have not been exercised. code coverage for SoC is usually a long pole in the Verification cycle typically because of huge Simulator Compile and Run times. The paper discusses the traditional SoC coverage closure methodology and proposes an automated methodology to efficiently manage the coverage enabled Simulation runs.

关键词： SoC Verification code coverage EDA

来源：评论

学校读者我要写书评

暂无评论

Multi-objective Optimization Based Software Testing Using Kansei Quality Approach 2

Multi-objective Optimization Based Software Testing Using Ka...

引用

2nd International Conference on Information Systems Design and Intelligent Applications (INDIA)

作者： Shilpa Choudhary, Kavita ITM Univ Gurgoan Haryana India

ISBN: (纸本)9788132222477;9788132222460

Software testing suggests the quality of the software product. More the effective testing means high quality software product. In this paper we have identified and prioritized the parameters according to the perspective of different entities involved in software lifecycle. The prime objective of the paper is to perform software testing from the perspective of Kansei Engineering methodology with multi-objective optimization.

关键词： Kansei approach Multi-objective optimization Fault tolerance Accuracy code coverage

来源：评论

学校读者我要写书评

暂无评论

Model-based integration testing of ROS packages: a mobile robot case study

Model-based integration testing of ROS packages: a mobile ro...

引用

European Conference on Mobile Robots

作者： Ernits, Juhan Halling, Evelin Kanter, Gert Vain, Juri Tallinn Univ Technol Dept Comp Sci Akad Tee 15a EE-12618 Tallinn Estonia

ISBN: (纸本)9781467391634

We apply model-based testing - a black box testing technology - to improve the state of the art of integration testing of navigation and localisation software for mobile robots built in ROS. Online model-based testing involves building executable models of the requirements and executing them in parallel with the implementation under test (IUT). In the current paper we present an automated approach to generating a model from the topological map that specifies where the robot can move to. In addition, we show how to specify scenarios of interest and how to add human models to the simulated environment according to a specified scenario. We measure the quality of the tests by code coverage, and empirically show that it is possible to achieve increased test coverage by specifying simple scenarios on the automatically generated model of the topological map. The scenarios augmented by adding humans to specified rooms at specified stages of the scenario simulate the changes in the environment caused by humans. Since we test navigation at coordinate and topological level, we report on finding problems related to the topological map.

关键词： control engineering computing mobile robots operating systems (computers) program testing software packages IUT ROS packages black box testing technology code coverage implementation under test localisation software mobile robot model-based integration testing navigation software online model-based testing topological map Adaptation models Automata Computational modeling Robot kinematics Software Testing Mobile robots TOPOLOGICAL MAPPING control engineering computing Robot kinematics program testing Automata Software packages Computational modeling computer software Aggregate tests Adaptation models

来源：评论

学校读者我要写书评

暂无评论

Model Based Test Case Generation and Optimization Using Intelligent Optimization Agent 2

Model Based Test Case Generation and Optimization Using Inte...

引用

2nd International Conference on Information Systems Design and Intelligent Applications (INDIA)

作者： Mahali, Prateeva Acharya, Arup Abhinna Mohapatra, Durga Prasad KIIT Univ Sch Comp Engn Bhubaneswar 751024 Orissa India Natl Inst Technol Dept Comp Sci Engn Rourkela 769008 India

ISBN: (纸本)9788132222507;9788132222491

Test case optimization is one of the techniques which efficiently manage the exponential growth in time and cost of testing. But in many times the researchers compromise with the code coverage while going for optimization. In this paper, the test suite is optimized using Intelligent Optimization Agent (IOA) while the keeping the percentage of code coverage unchanged. First the System Under Test (SUT) is modelled using UML Activity Diagram (AD) and converted into an Activity Graph (AG). Then the optimized path is found out in AD by using IOA and cost attributes. Then suitable algorithms are proposed to remove the redundant nodes in the optimized path. IOA is an agent based approach as compared to Hybrid Genetic Algorithm (HGA) in Intelligent Test Optimization Agent (ITOA). The proposed approach is found to be effective when compared with other optimization techniques like Genetic Algorithm (GA) and Intelligent Test Optimization Agent (ITOA).

关键词： Optimization IOA Testing code coverage UML activity diagram

来源：评论

学校读者我要写书评

暂无评论

Design & Verification of Automotive SoC Firmware 15

Design & Verification of Automotive SoC Firmware

引用

52nd ACM/EDAC/IEEE Design Automation Conference (DAC)

作者： Kleeberger, Veit B. Rutkowski, Stefan Coppens, Ruth Infineon Technol AG Design Enabling & Serv SoC Firmware Neubiberg Germany

ISBN: (纸本)9781450335201

Increasing complexity and functionality of automotive SoCs (Systems-on-Chip) leads to a growing part of functionality implemented in firmware. Requirements for short-time-to-market and extensive verification due to safety-critical environments requires firmware development and verification to happen concurrent with hardware development, which is challenging in traditional hardware-centric SoC flows. We present in this paper a set of different techniques part of Infineon's ISO 26262 flow for firmware development, which tackle these challenges and enable us to align firmware development to the same time line as the remaining SoC development.

关键词： ISO 26262 code coverage SoC Firmware Unit Test Host Compiled Execution RTL Verification

来源：评论

学校读者我要写书评

暂无评论

Total coverage Based Regression Test Case Prioritization using Genetic Algorithm 12

Total Coverage Based Regression Test Case Prioritization usi...

引用

International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)

作者： Konsaard, Patipat Ramingwong, Lachana Chiang Mai Univ Dept Comp Engn Chiang Mai Thailand

ISBN: (纸本)9781479979615

Regression Testing is a test to ensure that a program that was changed is still working. Changes introduced to a software product often come with defects. Additional test cases are, this could reduce the main challenges of regression testing is test case prioritization. Time, effort and budget needed to retest the software. Former studies in test case prioritization confirm the benefits of prioritization techniques. Most prioritization techniques concern with choosing test cases based on their ability to cover more faults. Other techniques aim to maximize code coverage. Thus, the test cases selected should secure the total coverage to assure the adequacy of software testing. In this paper, we present an algorithm to prioritize test cases based on total coverage using a modified genetic algorithm. Its performance on the average percentage of condition covered and execution time are compared with five other approaches.

关键词： Test case prioritization Test suite Regression testing Genetic algorith code coverage APCC Software Testing Software engineering

来源：评论

学校读者我要写书评

暂无评论

Concolic Execute Fuzzing Based on Control-Flow Analysis 11

Concolic Execute Fuzzing Based on Control-Flow Analysis

引用

11th International Conference on Computational Intelligence and Security (CIS)

作者： Li, Jingxi Xu, Xin Liao, Lejian Li, Lu Beijing Inst Technol Sch Comp Sci Beijing Engn Res Ctr High Volume Language Informa Beijing Key Lab Intelligent Informat Technol Beijing Peoples R China DISECC Beijing Peoples R China

ISBN: (纸本)9781467386609

This paper proposes a method which utilizing taint analysis to reduce the unnecessary analysis routine, concentrating on the control-flow altering input using concolic (concrete and symbolic) execution procedure. A prototype, ConcolicFuzz is implemented based on this method, which is built on Pin platform at x86 binary level and using Z3 as the SMT (Satisfiability Modulo Theories) solver. The results of experiments verify that our approach is effective in increasing code coverage with remarkably lower resource and time cost than the standard fuzzing and concolic testing tools. The scale of fuzzing range and symbols are reduced, so as the computing resource and time consumption, especially when the input data is in highly structured and complex file format.

关键词： dynamic taint analysis concolic execution control-flow fuzzing test code coverage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：