Abstract
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 pairwise distance among elements of the subset. We propose efficient approximate algorithms that for any k generate both k nucleus and perimeter elements. Since relevant applications involve metric spaces of complex objects (e. g. large trees or graphs, long strings such as biosequences, high dimensional Euclidean spaces) whose pairwise distance calculation is heavy, then efficiency of such algorithms is very much affected by the number of distance calculations among objects of the subspace. Computing the exact k minimal elements in the nucleus and the k maximal elements in the perimeter requires an obvious quadratic solution in the size of the input set. However even a quadratic algorithm can be prohibitive due to a sufficiently large size of the input domain. Our approximate algorithms run in O (kn) time. Therefore since in software testing the size n of the input domain is much larger than the test size k then the quadratic brute force exact algorithm may become infeasible while our test generation algorithms may be successfully used.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
V. Auletta, D. Parente, and G. Persiano. Dynamic and static algorithms for optimal placement of resources in a tree. Theoretical Computer Science, 165:441–461, 1996.
S. Battiato, D. Cantone, D. Catalano, G. Cincotti, and M. Hofri. An efficient algorithm for the approximate median selection problem. Proceedings of the 4th Italian Conference on Algorithms and Complexity (CIAC 2000), volume 1767 of Lecture Notes in Computer Science, Springer-Verlag, pages 226-238, 2000.
B. Beizer. Software Testing Techniques. Van Nostrand Reinhold, New York, 1990.
R. E. Burkard and J. Krarup. A linear algorithm for the pos/neg-weighted 1-median problem on a cactus. Computing, 60(3):193–216, 1998.
D. Cantone, G. Cincotti, A. Ferro, and A. Pulvirenti. An efficient algorithm for the 1-median problem. Tech. Rept., 2003.
Greg N. Frederickson. Parametric search and locating supply centers in trees. F. Dehne and J.-R. Sack and N. Santoro, editors, Algorithms and Data Structures, 2nd Workshop WADS’ 91, volume 519 of Lecture Notes in Computer Science, pages 299-319, 1991.
V. Ganti, R. Ramakrishnan, J. Gehrke, A. Powell, and J. French. Clustering large datasets in arbitrary metric spaces. Proceedings of the I EE E 15th International Conference on Data Engineering, pages 502-511, 1999.
E. Gusfield. Efficient methods for multiple sequence alignments with guaranteed error bounds. Bulletin of Mathematical Biology, 55:141–154, 1993.
D. Hoffman, P. Strooper, and L. White. Reid s. c., ”module tresting techniques: which are the most effective? Proceedings of EuroSTAR97, 1997.
D. Hoffman, P. Strooper, and L. White. Boundary values and automated component testing. Softw. Test. Verif. Reliab, 9:3–26, 1999.
P. Indyk. Sublinear time algorithms for metric space problems. Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 428-434, 1999.
G.J. Myers. The Art of Software Testing. Wiley, New York, 1979.
D.J. Richardson and L.A. Clarke. Partition analysis: a method combining testing and verification. IEEE Trans. Softw. Engin., 11(12):1477–1490, 1985.
T.F. Smith and M.S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147(1):195–197, 1981.
E.J. Weyuker and T.J. Ostrand. Theories of program testing and the application of revealing subdomains. IEEE Trans. Softw. Engin., 6(3):236–246, 1980.
L.J. White and E.I. Cohen. A domain strategy for computer programming testing. IEEE Trans. Softw. Engin., 6(3):247–257, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ferro, A., Giugno, R., Pulvirenti, A. (2003). Efficient Boundary Values Generation in General Metric Spaces for Software Component Testing. In: Dershowitz, N. (eds) Verification: Theory and Practice. Lecture Notes in Computer Science, vol 2772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39910-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-39910-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21002-3
Online ISBN: 978-3-540-39910-0
eBook Packages: Springer Book Archive