{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:18:24Z","timestamp":1725574704290},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540210023"},{"type":"electronic","value":"9783540399100"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39910-0_15","type":"book-chapter","created":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T06:40:04Z","timestamp":1395124804000},"page":"318-331","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Boundary Values Generation in General Metric Spaces for Software Component Testing"],"prefix":"10.1007","author":[{"given":"Alfredo","family":"Ferro","sequence":"first","affiliation":[]},{"given":"Rosalba","family":"Giugno","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"Pulvirenti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0304-3975(96)00089-8","volume":"165","author":"V Auletta","year":"1996","unstructured":"V. Auletta, D. Parente, and G. Persiano. Dynamic and static algorithms for optimal placement of resources in a tree. Theoretical Computer Science, 165:441\u2013461, 1996.","journal-title":"Theoretical Computer Science"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-46521-9_19"},{"key":"15_CR3","volume-title":"Software Testing Techniques","author":"B Beizer","year":"1990","unstructured":"B. Beizer. Software Testing Techniques. Van Nostrand Reinhold, New York, 1990."},{"issue":"3","key":"15_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02684332","volume":"60","author":"RE Burkard","year":"1998","unstructured":"R. E. Burkard and J. Krarup. A linear algorithm for the pos\/neg-weighted 1-median problem on a cactus. Computing, 60(3):193\u2013216, 1998.","journal-title":"Computing"},{"key":"15_CR5","unstructured":"D. Cantone, G. Cincotti, A. Ferro, and A. Pulvirenti. An efficient algorithm for the 1-median problem. Tech. Rept., 2003."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"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\u2019 91, volume 519 of Lecture Notes in Computer Science, pages 299-319, 1991.","DOI":"10.1007\/BFb0028271"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/ICDE.1999.754966"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF02460299","volume":"55","author":"E Gusfield","year":"1993","unstructured":"E. Gusfield. Efficient methods for multiple sequence alignments with guaranteed error bounds. Bulletin of Mathematical Biology, 55:141\u2013154, 1993.","journal-title":"Bulletin of Mathematical Biology"},{"key":"15_CR9","unstructured":"D. Hoffman, P. Strooper, and L. White. Reid s. c., \u201dmodule tresting techniques: which are the most effective? Proceedings of EuroSTAR97, 1997."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/(SICI)1099-1689(199903)9:1<3::AID-STVR169>3.0.CO;2-Z","volume":"9","author":"D Hoffman","year":"1999","unstructured":"D. Hoffman, P. Strooper, and L. White. Boundary values and automated component testing. Softw. Test. Verif. Reliab, 9:3\u201326, 1999.","journal-title":"Softw. Test. Verif. Reliab"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"P. Indyk. Sublinear time algorithms for metric space problems. Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 428-434, 1999.","DOI":"10.1145\/301250.301366"},{"key":"15_CR12","volume-title":"The Art of Software Testing","author":"GJ Myers","year":"1979","unstructured":"G.J. Myers. The Art of Software Testing. Wiley, New York, 1979."},{"issue":"12","key":"15_CR13","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1109\/TSE.1985.231892","volume":"11","author":"DJ Richardson","year":"1985","unstructured":"D.J. Richardson and L.A. Clarke. Partition analysis: a method combining testing and verification. IEEE Trans. Softw. Engin., 11(12):1477\u20131490, 1985.","journal-title":"IEEE Trans. Softw. Engin."},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"TF Smith","year":"1981","unstructured":"T.F. Smith and M.S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147(1):195\u2013197, 1981.","journal-title":"Journal of Molecular Biology"},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1109\/TSE.1980.234485","volume":"6","author":"EJ Weyuker","year":"1980","unstructured":"E.J. Weyuker and T.J. Ostrand. Theories of program testing and the application of revealing subdomains. IEEE Trans. Softw. Engin., 6(3):236\u2013246, 1980.","journal-title":"IEEE Trans. Softw. Engin."},{"issue":"3","key":"15_CR16","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1109\/TSE.1980.234486","volume":"6","author":"LJ White","year":"1980","unstructured":"L.J. White and E.I. Cohen. A domain strategy for computer programming testing. IEEE Trans. Softw. Engin., 6(3):247\u2013257, 1980.","journal-title":"IEEE Trans. Softw. Engin."}],"container-title":["Lecture Notes in Computer Science","Verification: Theory and Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39910-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T11:43:23Z","timestamp":1558871003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39910-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540210023","9783540399100"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39910-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}