Efficient Boundary Values Generation in General Metric Spaces for Software Component Testing

@inproceedings{Ferro2003EfficientBV,
  title={Efficient Boundary Values Generation in General Metric Spaces for Software Component Testing},
  author={Alfredo Ferro and Rosalba Giugno and Alfredo Pulvirenti},
  booktitle={Verification: Theory and Practice},
  year={2003}
}
One of the most classical and successful software testing strategies is that of testing boundary values in the input domain (Reid 1997). In this paper we introduce a notion of boundary values for a finite subset of a metric space. Boundary values are distinguished between nucleus (central elements) and perimeter (peripheral elements). Nucleus (resp. perimeter) elements are those objects whose average distance from any other element in the subset is much smaller (resp. larger) than the average… 

References

SHOWING 1-10 OF 15 REFERENCES
Clustering large datasets in arbitrary metric spaces
TLDR
Two scalable algorithms designed for clustering very large datasets in distance spaces are presented, one of which is, to the authors' knowledge, the first scalable clustering algorithm for data in a distance space and the second improves upon BUBBLE by reducing the number of calls to the distance function, which may be computationally very expensive.
A Domain Strategy for Computer Program Testing
This paper presents a testing strategy desiged to detect errors in the control flow of a computer program, and the conditions under which this strategy is reliable are given and characterized. The
An Efficient Approximate Algorithm for the 1-Median Problem in Metric Spaces
TLDR
A simple and natural linear randomized algorithm for the approximate 1-median selection problem in metric spaces, which performs better than Indyk's algorithm in practice and is able to produce experimental evidence of its precision.
Partition Analysis: A Method Combining Testing and Verification
TLDR
The partition analysis method is described and the results obtained from an evaluation of its effectiveness are reported, showing that through the integration of testing and verification, as well as through the use of information derived from both the implementation and the specification, the partitionAnalysis method is effective for evaluating program reliability.
Identification of common molecular subsequences.
Dynamic and Static Algorithms for Optimal Placement of Resources in a Tree
Sublinear time algorithms for metric space problems
  • P. Indyk
  • Computer Science, Mathematics
    STOC '99
  • 1999
In this paper we give approximation algorithms for the following problems on metric spaces: Furthest Pair, kmedian, Minimum Routing Cost Spanning Tree, Multiple Sequence Alignment, Maximum Traveling
An Efficient Algorithm for the Approximate Median Selection Problem
TLDR
An efficient algorithm for the approximate median selection problem that works in-place; it is fast and easy to implement, and returns, with high probability, a very close estimate of the true median.
Art of Software Testing
TLDR
Comprehensively covers psychological and economic principles, managerial aspects of testing, test tools, high-order testing, code inspections, and debugging, and programming students will find this reference work indispensible.
Theories of Program Testing and the Application of Revealing Subdomains
TLDR
The concepts of a revealing test criterion and a revealing subdomain are proposed and used to provide a basis for constructing program tests.
...
...