نتایج جستجو برای: code coverage

تعداد نتایج: 251066  

Journal: :IEICE Transactions 2011
Kazunori Sakamoto Fuyuki Ishikawa Hironori Washizaki Yoshiaki Fukazawa

Test coverage is an important indicator of whether software has been sufficiently tested. However, there are several problems with the existing measurement tools for test coverage, such as their cost of development and maintenance, inconsistency, and inflexibility in measurement. We propose a consistent and flexible measurement framework for test coverage that we call the Open Code Coverage Fra...

Journal: :CoRR 2013
Alexandre Perez

Nowadays, locating software components responsible for observed failures is one of the most expensive and error-prone tasks in the software development process. To improve the debugging process efficiency, some effort was already made to automatically assist the detection and location of software faults. This led to the creation of statistical debugging tools such as Tarantula, Zoltar and GZolt...

Journal: :Applied Mathematics and Computer Science 2010
Robert Gold

The control flow of programs can be represented by directed graphs. In this paper we provide a uniform and detailed formal basis for control flow graphs combining known definitions and results with new aspects. Two graph reductions are defined using only syntactical information about the graphs, but no semantical information about the represented programs. We prove some properties of reduced gr...

2013
Rolf Johansson Hans Eriksson Hans Svensson Kenneth Östberg Thomas Arts Alex Gerdes Martin A. Skoglund

This position paper argues that using code coverage metrics to evaluate the completeness of test cases as prescribed by e.g. ISO26262, is insufficient in a safety context. On the other hand it is impossible to execute test cases that achieve 100% completeness with respect to all possible input data combinations testing all requirements. We propose that existing requirements on code coverage sha...

Journal: :IJBIC 2012
Komal Agarwal Manish Goyal Praveen Ranjan Srivastava

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., intelli...

2003
Gary Feierbach Vijay Gupta

There are a number of RTL coverage tools on the market today that essentially tells you only that a set of signals has been toggled by a particular diagnostic test. This is useful in showing what areas of the RTL design are definitely not covered by the diagnostic test but tells you very little about the set of signals that have been toggled. In an extreme case a diagnostic test may fail to fai...

2010
Yi Wei Bertrand Meyer Manuel Oriol

Most approaches to testing use branch coverage to decide on the quality of a given test suite. The intuition is that covering branches relates directly to uncovering faults. The empirical study reported here applied random testing to 14 Eiffel classes for a total of 2520 hours and recorded the number of uncovered faults and the branch coverage over time. For the tested classes, (1) random testi...

2002
Mechelle Gittens Hanan Lutfiyya Michael Anthony Bauer David Godwin Yong Woo Kim Pramod Gupta

We had the opportunity to conduct an empirical study in the context of the testing environment for a large commercial product. The particular goal of the organization for which this study was done, was to gain a strong understanding of how particular aspects of their testing practice impact on the quality of the released products. In this paper we present some of the results of that research as...

2001
Cristian Sminchisescu Dimitris N. Metaxas Sven J. Dickinson

Previous approaches to deformable model shape estimation and tracking have assumed a fixed class of shapes representation (e.g., deformable superquadrics), initialized prior to tracking. Since the shape coverage of the model is fixed, such approaches do not directly accommodate incremental representation discovery during tracking. As a result, model shape coverage is decoupled from tracking, th...

2000
Flavio Tonidandel Marcio Rillo

The majority of case-based planning systems consider an infinite case memory to store their cases. However, the size of the case memory is limited and it can become a barrier for case-based systems efficiency when it is full. This paper presents a method that refines and abstracts cases in order to release memory space for a new case. However, in some situations, some cases must be chosen to be...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید