{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:49:15Z","timestamp":1758271755165,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642049439"},{"type":"electronic","value":"9783642049446"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04944-6_13","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T02:09:36Z","timestamp":1253066976000},"page":"156-168","source":"Crossref","is-referenced-by-count":11,"title":["Theoretical Analysis of Local Search in Software Testing"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Arcuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/stvr.294","volume":"14","author":"P. McMinn","year":"2004","unstructured":"McMinn, P.: Search-based software test data generation: A survey. Software Testing, Verification and Reliability\u00a014(2), 105\u2013156 (2004)","journal-title":"Software Testing, Verification and Reliability"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/s11704-009-0006-6","volume":"3","author":"P.K. Lehre","year":"2009","unstructured":"Lehre, P.K., Yao, X.: Runtime analysis of search heuristics on software engineering problems. Frontiers of Computer Science in China\u00a03(1), 64\u201372 (2009)","journal-title":"Frontiers of Computer Science in China"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., Yao, X.: Runtime analysis of (1+1) ea on computing unique input output sequences. In: IEEE Congress on Evolutionary Computation (CEC), pp. 1882\u20131889 (2007)","DOI":"10.1109\/CEC.2007.4424703"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-540-89694-4_60","volume-title":"Simulated Evolution and Learning","author":"P.K. Lehre","year":"2008","unstructured":"Lehre, P.K., Yao, X.: Crossover can be constructive when computing unique input output sequences. In: Li, X., Kirley, M., Zhang, M., Green, D., Ciesielski, V., Abbass, H.A., Michalewicz, Z., Hendtlass, T., Deb, K., Tan, K.C., Branke, J., Shi, Y. (eds.) SEAL 2008. LNCS, vol.\u00a05361, pp. 595\u2013604. Springer, Heidelberg (2008)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Harman, M., McMinn, P.: A theoretical and empirical study of search based testing: Local, global and hybrid search. IEEE Transactions on Software Engineering (to appear)","DOI":"10.1109\/TSE.2009.71"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Harman, M., McMinn, P.: A theoretical & empirical analysis of evolutionary testing and hill climbing for structural test data generation. In: Proceedings of the International Symposium on Software Testing and Analysis (ISSTA), pp. 73\u201383 (2007)","DOI":"10.1145\/1273463.1273475"},{"key":"13_CR7","unstructured":"Arcuri, A., Lehre, P., Yao, X.: Theoretical runtime analysis in search based software engineering. Technical Report CSR-09-04, University of Birmingham"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Arcuri, A., Lehre, P.K., Yao, X.: Theoretical runtime analyses of search algorithms on the test data generation for the triangle classification problem. In: International Workshop on Search-Based Software Testing (SBST), pp.\u00a0161\u2013169 (2008)","DOI":"10.1109\/ICSTW.2008.48"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Arcuri, A.: Full theoretical runtime analysis of alternating variable method on the triangle classification problem. In: International Symposium on Search Based Software Engineering (SSBSE), pp.\u00a0113\u2013121 (2009)","DOI":"10.1109\/SSBSE.2009.16"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Arcuri, A.: Longer is better: On the role of test sequence length in software testing. Technical Report CSR-09-03, University of Birmingham (2009)","DOI":"10.1109\/ICST.2010.16"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s00224-004-1177-z","volume":"39","author":"S. Droste","year":"2006","unstructured":"Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems\u00a039(4), 525\u2013544 (2006)","journal-title":"Theory of Computing Systems"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S. Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science\u00a0276, 51\u201381 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:NACO.0000023417.31393.c7","volume":"3","author":"J. He","year":"2004","unstructured":"He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing\u00a03(1), 21\u201335 (2004)","journal-title":"Natural Computing"},{"key":"13_CR14","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-73482-6_4","volume-title":"Foundations of Genetic Algorithms","author":"T. Jansen","year":"2007","unstructured":"Jansen, T.: On the brittleness of evolutionary algorithms. In: Stephens, C.R., Toussaint, M., Whitley, L.D., Stadler, P.F. (eds.) FOGA 2007. LNCS, vol.\u00a04436, pp. 54\u201369. Springer, Heidelberg (2007)"},{"key":"13_CR16","unstructured":"R Development Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2008) ISBN 3-900051-07-0"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Arcuri, A.: Insight knowledge in search based software testing. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 1649\u20131656 (2009)","DOI":"10.1145\/1569901.1570122"},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s11633-007-0281-3","volume":"4","author":"P.S. Oliveto","year":"2007","unstructured":"Oliveto, P.S., He, J., Yao, X.: Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing\u00a04(3), 281\u2013293 (2007)","journal-title":"International Journal of Automation and Computing"}],"container-title":["Lecture Notes in Computer Science","Stochastic Algorithms: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04944-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:15:57Z","timestamp":1739337357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04944-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642049439","9783642049446"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04944-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}