18528231
In regression testing selection when source code is not available
17173349
A lightweight process for change identification and regression test selection in using COTS components
Various regression test selection techniques have been developed and have shown fault detection effectiveness. The majority of these test selection techniques rely on access to source code for change identification. However, when new releases of COTS components are made available for integration and testing, source code is often not available. In this paper, we present a lightweight integrated-black-box approach for component change identification (I-BACCI) process for selection of regression tests for user/glue code that uses COTS components. I-BACCI is applicable when component licensing agreements do not preclude analysis of the binary files. A case study of the process was conducted on an ABB product that uses a medium-scale internal ABB software component. Five releases of the component were examined to evaluate the efficacy of the proposed process. The result of the case study indicates this process can reduce the required number of regression tests by 54% on average.
9909178
On the value of static analysis for fault detection in software
No single software fault-detection technique is capable of addressing all fault-detection concerns. Similarly to software reviews and testing, static analysis tools (or automated static analysis) can be used to remove defects prior to release of a software product. To determine to what extent automated static analysis can help in the economic production of a high-quality product, we have analyzed static analysis faults and test and customer-reported failures for three large-scale industrial software systems developed at Nortel Networks. The data indicate that automated static analysis is an affordable means of software fault detection. Using the orthogonal defect classification scheme, we found that automated static analysis is effective at identifying assignment and checking faults, allowing the later software production phases to focus on more complex, functional, and algorithmic faults. A majority of the defects found by automated static analysis appear to be produced by a few key types of programmer errors and some of these types have the potential to cause security vulnerabilities. Statistical analysis results indicate the number of automated static analysis faults can be effective for identifying problem modules. Our results indicate static analysis tools are complementary to other fault-detection techniques for the economic production of a high-quality software product.
7059364
Non-uniform recursive subdivision surfaces
Doo-Sabin and Catmull-Clark subdivision surfaces are based on the notion of repeated knot insertion of uniform tensor product B-spline surfaces. This paper develops rules for non-uniform Doo-Sabin and Catmull-Clark surfaces that generalize non-uniform tensor product Bspline surfaces to arbitrary topologies. This added flexibility allows, among other things, the natural introduction of features such as cusps, creases, and darts, while elsewhere maintaining the same order of continuity as their uniform counterparts.
5971327
Approximate Implicitization Using Monoid Curves and Surfaces
Abstract This paper presents an approach to finding an approximate implicit equation and an approximate inversion map of a planar rational parametric curve or a rational parametric surface. High accuracy of the approximation is achieved with a relatively small number of low-degree curve segments or surface patches. By using monoid curves and surfaces, the method eliminates the undesirable singularities and “phantom” branches normally associated with implicit representation. The monoids are expressed in exact implicit and parametric equations simultaneously, and upper bounds are derived for the approximate errors of implicitization and inversion equations.
40804986
Bounds on the Moving Control Points of Hybrid Curves
Abstract Hybrid curves provide an attractive method for approximating rational Bezier curves by polynomial Bezier curves. In this paper, several methods are provided to estimate the error bounds for the approximation to the moving control point of the hybrid curves. When the given rational Bezier curves satisfies the convergent conditions for moving control point of the hybrid curve, by these methods we can choose a hybrid curve with a certain degree such that the distance between the moving control point and a special point is less than a given error bound ϵ. So the polynomial Bezier curves to approximate the rational Bezier curve can be obtained by replacing the moving control point with the special point.
1709850
Estimating tessellation parameter intervals for rational curves and surfaces
This paper presents a method for determining a priori a constant parameter interval for tessellating a rational curve or surface such that the deviation of the curve or surface from its piecewise linear approximation is within a specified tolerance. The parameter interval is estimated based on information about second-order derivatives in the homogeneous coordinates, instead of using affine coordinates directly. This new step size can be found with roughly the same amount of computation as the step size in Cheng [1992], though it can be proven to always be larger than Cheng's step size. In fact, numerical experiments show the new step is typically orders of magnitude larger than the step size in Cheng [1992]. Furthermore, for rational cubic and quartic curves, the new step size is generally twice as large as the step size found by computing bounds on the Bernstein polynomial coefficients of the second derivatives function.