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

code coverage and Postrelease Defects: A Large-Scale Study on Open Source Projects

IEEE TRANSACTIONS ON RELIABILITY 2017年第4期66卷 1213-1228页

作者： Kochhar, Pavneet Singh Lo, David Lawall, Julia Nagappan, Nachiappan Singapore Management Univ Sch Informat Syst Singapore 188065 Singapore INRIA F-75012 Paris France Microsft Res Redmond WA 98052 USA

Testing is a pivotal activity in ensuring the quality of software. code coverage is a common metric used as a yardstick to measure the efficacy and adequacy of testing. However, does higher coverage actually lead to a decline in postrelease bugs? Do files that have higher test coverage actually have fewer bug reports? The direct relationship between code coverage and actual bug reports has not yet been analyzed via a comprehensive empirical study on real bugs. Past studies only involve a few software systems or artificially injected bugs (mutants). In this empirical study, we examine these questions in the context of open-source software projects based on their actual reported bugs. We analyze 100 large open-source Java projects and measure the code coverage of the test cases that come along with these projects. We collect real bugs logged in the issue tracking system after the release of the software and analyze the correlations between code coverage and these bugs. We also collect other metrics such as cyclomatic complexity and lines of code, which are used to normalize the number of bugs and coverage to correlate with other metrics as well as use thesemetrics in regression analysis. Our results showthat coverage has an insignificant correlation with the number of bugs that are found after the release of the software at the project level, and no such correlation at the file level.

关键词： code coverage empirical study open-source postrelease defects software testing

来源：评论

学校读者我要写书评

暂无评论

code coverage of Adaptive Random Testing

引用

IEEE TRANSACTIONS ON RELIABILITY 2013年第1期62卷 226-237页

作者： Chen, Tsong Yueh Kuo, Fei-Ching Liu, Huai Wong, W. Eric Swinburne Univ Technol Fac Informat & Commun Technol Hawthorn Vic 3122 Australia Univ Texas Dallas Dept Comp Sci Richardson TX 75083 USA

Random testing is a basic software testing technique that can be used to assess the software reliability as well as to detect software failures. Adaptive random testing has been proposed to enhance the failure-detection capability of random testing. Previous studies have shown that adaptive random testing can use fewer test cases than random testing to detect the first software failure. In this paper, we evaluate and compare the performance of adaptive random testing and random testing from another perspective, that of code coverage. As shown in various investigations, a higher code coverage not only brings a higher failure-detection capability, but also improves the effectiveness of software reliability estimation. We conduct a series of experiments based on two categories of code coverage criteria: structure-based coverage, and fault-based coverage. Adaptive random testing can achieve higher code coverage than random testing with the same number of test cases. Our experimental results imply that, in addition to having a better failure-detection capability than random testing, adaptive random testing also delivers a higher effectiveness in assessing software reliability, and a higher confidence in the reliability of the software under test even when no failure is detected.

关键词： Adaptive random testing code coverage failure-based testing random testing

来源：评论

学校读者我要写书评

暂无评论

code coverage using intelligent water drop (IWD)

引用

INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION 2012年第6期4卷 392-402页

作者： Agarwal, Komal Goyal, Manish Srivastava, Praveen Ranjan BITS Dept Comp Sci & Informat Syst Pilani 333031 Rajasthan India

Software testing is one of the most challenging and arduous phase of software development life cycle (SDLC) which helps in determining the software quality. code coverage is a widely used testing paradigm, which describes the degree to which the code has been tested. Aim of the current paper is to propose an optimised code coverage algorithm with the help of an emerging technique, i.e., intelligent water drop (IWD). This approach uses dynamic parameters for finding all the optimal paths using basic properties of natural water drops. It proposes how test cases can be considered as an IWD moving on the edges of the control dependency graph for finding the optimal paths. The algorithm guarantees complete code coverage by generating automated test sequences.

关键词： code coverage intelligent water drop IWD control dependence graph CDG test case

来源：评论

学校读者我要写书评

暂无评论

code coverage differences of Java bytecode and source code instrumentation tools

引用

SOFTWARE QUALITY JOURNAL 2019年第1期27卷 79-123页

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

Many software testing fields, like white-box testing, test case generation, test prioritization, and fault localization, depend on code coverage measurement. If used as an overall completeness measure, the minor inaccuracies of coverage data reported by a tool do not matter that much;however, in certain situations, they can lead to serious confusion. For example, a code element that is falsely reported as covered can introduce false confidence in the test. This work investigates code coverage measurement issues for the Java programming language. For Java, the prevalent approach to code coverage measurement is using bytecode instrumentation due to its various benefits over source code instrumentation. As we have experienced, bytecode instrumentation-based code coverage tools produce different results than source code instrumentation-based ones in terms of the reported items as covered. We report on an empirical study to compare the code coverage results provided by tools using the different instrumentation types for Java coverage measurement on the method level. In particular, we want to find out how much a bytecode instrumentation approach is inaccurate compared to a source code instrumentation method. The differences are systematically investigated both in quantitative (how much the outputs differ) and in qualitative terms (what the causes for the differences are). In addition, the impact on test prioritization and test suite reduction-a possible application of coverage measurement-is investigated in more detail as well.

关键词： code coverage White-box testing Java bytecode instrumentation Source code instrumentation coverage tools Empirical study

来源：评论

学校读者我要写书评

暂无评论

code coverage and Test Suite Effectiveness: Empirical Study with Real Bugs in Large Systems 22

Code Coverage and Test Suite Effectiveness: Empirical Study ...

引用

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

作者： Kochhar, Pavneet Singh Thung, Ferdian Lo, David Singapore Management Univ Singapore Singapore

ISBN: (纸本)9781479984695

During software maintenance, testing is a crucial activity to ensure the quality of program code as it evolves over time. With the increasing size and complexity of software, adequate software testing has become increasingly important. code coverage is often used as a yardstick to gauge the comprehensiveness of test cases and the adequacy of testing. A test suite quality is often measured by the number of bugs it can find (aka. kill). Previous studies have analysed the quality of a test suite by its ability to kill mutants, i.e., artificially seeded faults. However, mutants do not necessarily represent real bugs. Moreover, many studies use small programs which increases the threat of the applicability of the results on large real-world systems. In this paper, we analyse two large software systems to measure the relationship of code coverage and its effectiveness in killing real bugs from the software systems. We use Randoop, a random test generation tool to generate test suites with varying levels of coverage and run them to analyse if the test suites can kill each of the real bugs or not. In this preliminary study, we have performed an experiment on 67 and 92 real bugs from Apache HTTPClient and Mozilla Rhino, respectively. Our experiment finds that there is indeed statistically significant correlation between code coverage and bug kill effectiveness. The strengths of the correlation, however, differ for the two software systems. For HTTPClient, the correlation is moderate for both statement and branch coverage. For Rhino, the correlation is strong for both statement and branch coverage.

关键词： code coverage Bugs Test Suite Effectiveness

来源：评论

学校读者我要写书评

暂无评论

code coverage Measurement for Android Dynamic Analysis Tools 3

Code Coverage Measurement for Android Dynamic Analysis Tools

引用

IEEE 3rd International Conference on Mobile Services MS

作者： Huang, Chun-Ying Chiu, Ching-Hsiang Lin, Chih-Hung Tzeng, Han-Wei Natl Taiwan Ocean Univ Dept Comp Sci & Engn Keelung Taiwan Inst Informat Ind CyberTrust Technol Inst Taipei Taiwan

ISBN: (纸本)9781467372848

It is common to inspect an Android application using static or dynamic analysis techniques. Most traditional tools adopt static analysis techniques due to its low cost and high performance properties. However, since an inspected target could be obfuscated, it is also common to work with dynamic analysis techniques so that complete runtime information can be obtained to provide in-depth application behavior. Although there are already a lot of tools based on dynamic analysis techniques, the capability of such a tool is unknown. It is straightforward to understand the capability of a dynamic analysis tool by measuring its code coverage. However, to our knowledge, there is not a universal approach for measuring code coverage for all dynamic analysis tools, especially when a tool is only accessible remotely. In this paper, we propose an approach to measure code coverage for dynamic analysis tools. We design and implement the approach to measure code coverage for both online and off-line dynamic analysis tools. We then pick online tools including ABM, Anubis, CopperDroid, Tracedroid, as well as off-line tools including standard Android emulator, DroidBox, and DroidScope. Our measurement results show that the average coverage rate for each tool lies between 20% and 60%. We believe that our approach can provide more information for researchers and developers to better understand and improve the capability of dynamic analysis techniques.

关键词： Android code coverage dynamic analysis mobile security software inspection

来源：评论

学校读者我要写书评

暂无评论

OCCOM - Efficient computation of observability-based code coverage metrics for functional verification

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2001年第8期20卷 1003-1015页

作者： Fallah, F Devadas, S Keutzer, K Fujitsu Labs Amer Inc Sunnyvale CA 94086 USA MIT Cambridge MA 02139 USA Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

Functional simulation is still the primary workhorse for verifying the functional correctness of hardware designs, Functional verification is necessarily incomplete because it is not computationally feasible to exhaustively simulate designs. It is important, therefore, to quantitatively measure the degree of verification coverage of the design, coverage metrics proposed for measuring the extent of design verification provided by a set of Functional simulation vectors should compute statement execution counts (controllability information) and check to see whether effects of possible errors activated by program stimuli can be observed at the circuit outputs (observability information). Unfortunately the metrics proposed thus far either do not compute both types of information or are inefficient, i.e., the overhead of computing the metric is very large. In this paper, we provide the details of an efficient method to compute an observability-based code coverage metric that can be used while simulating complex hardware description language (HDL) designs, This method offers a more accurate assessment of design verification coverage than line coverage and is significantly more computationally efficient than prior efforts to assess observability information because it breaks up the computation into two phases: functional simulation of a modified HDL model followed by analysis of a flowgraph extracted from the HDL model, Commercial HDL simulators can be directly used for the time-consuming first phase and the second phase can be performed efficiently using concurrent evaluation techniques.

关键词： code coverage functional verification observability OCCOM

来源：评论

学校读者我要写书评

暂无评论

code coverage-Based Regression Test Selection and Prioritization in WebKit

Code Coverage-Based Regression Test Selection and Prioritiza...

引用

28th International Conference on Software Maintenance (ICSM)

作者： Beszedes, Arpad Gergely, Tamas Schrettner, Lajos Jasz, Judit Lango, Laszlo Gyimothy, Tibor Univ Szeged Dept Software Engn HAS Res Grp Szeged Hungary

ISBN: (纸本)9781467323123

Automated regression testing is often crucial in order to maintain the quality of a continuously evolving software system. However, in many cases regression test suites tend to grow too large to be suitable for full re-execution at each change of the software. In this case selective retesting can be applied to reduce the testing cost while maintaining similar defect detection capability. One of the basic test selection methods is the one based on code coverage information, where only those tests are included that cover some parts of the changes. We experimentally applied this method to the open source web browser engine project WebKit to find out the technical difficulties and the expected benefits if this method is to be introduced into the actual build process. Although the principle is simple, we had to solve a number of technical issues, so we report how this method was adapted to be used in the official build environment. Second, we present results about the selection capabilities for a selected set of revisions of WebKit, which are promising. We also applied different test case prioritization strategies to further reduce the number of tests to execute. We explain these strategies and compare their usefulness in terms of defect detection and test suite reduction.

关键词： Regression testing test case selection code coverage test prioritization test quality WebKit

来源：评论

学校读者我要写书评

暂无评论

code coverage of Assertions Using RTL Source code Analysis 14

Code Coverage of Assertions Using RTL Source Code Analysis

引用

51st ACM/EDAC/IEEE Design Automation Conference (DAC)

作者： Athavale, Viraj Ma, Sai Hertz, Samuel Vasudevan, Shobha Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA

ISBN: (纸本)9781450327305

Assertions are gaining importance in pre-silicon hardware verification to ensure expected design behavior. coverage of an assertion in terms of statements of a Register Transfer Level (RTL) source code is a very accessible metric for understanding the scope of assertions and for debug. However, few methods to report it currently exist. We present a methodology to define and compute code coverage of an assertion. Our method is based on static and dynamic analysis of the RTL source code. We demonstrate the scalability and effectiveness of our approach with experimental results on real designs for both manual and automatically generated assertions.

关键词： code coverage assertions formal verification static analysis

来源：评论

学校读者我要写书评

暂无评论

Post-Silicon code coverage for Multiprocessor System-on-Chip Designs

引用

IEEE TRANSACTIONS ON COMPUTERS 2013年第2期62卷 242-246页

作者： Balston, Kyle Karimibiuki, Mehdi Hu, Alan J. Ivanov, Andre Wilton, Steven J. E. Univ British Columbia Dept Elect & Comp Engn Vancouver BC V6T 1Z4 Canada Univ British Columbia Dept Comp Sci Vancouver BC V6T 1Z4 Canada

Effective techniques for post-silicon validation are required to better evaluate functional correctness of increasingly complex multi and many-core SoCs. However, there is little data evaluating the coverage of post-silicon validation efforts on industrial-scale designs. In this paper, we address this knowledge gap by instrumenting a nontrivial SoC with on-chip coverage monitors to measure the coverage achieved by typical post-silicon validation tests, such as booting the operating system (OS). We compare coverage achieved pre and post-silicon, and also measure the area overhead required to monitor post-silicon coverage. Our results show that the typical test of booting the OS often achieves high coverage, well correlated to what is achieved by pre-silicon directed tests, but in some blocks the coverage can be low or markedly different between pre and post-silicon, highlighting the importance of post-silicon validation in general and post-silicon coverage measurement in particular.

关键词： FPGA emulation pre-silicon validation post-silicon validation code coverage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：