{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:03Z","timestamp":1763468223234},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662443026"},{"type":"electronic","value":"9783662443033"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44303-3_12","type":"book-chapter","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T20:55:37Z","timestamp":1408568137000},"page":"137-149","source":"Crossref","is-referenced-by-count":85,"title":["Using Genetic Improvement and Code Transplants to Specialise a C++ Program to a Problem Class"],"prefix":"10.1007","author":[{"given":"Justyna","family":"Petke","sequence":"first","affiliation":[]},{"given":"Mark","family":"Harman","sequence":"additional","affiliation":[]},{"given":"William B.","family":"Langdon","sequence":"additional","affiliation":[]},{"given":"Westley","family":"Weimer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"MiniSAT-hack track of SAT competition. In 2009 this was part of the 12th International Conference on Theory and Applications of Satisfiability Testing (2009), http:\/\/www.satcompetition.org\/2009\/"},{"key":"12_CR2","first-page":"162","volume-title":"Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2008)","author":"A. Arcuri","year":"2008","unstructured":"Arcuri, A., Yao, X.: A Novel Co-evolutionary Approach to Automatic Software Bug Fixing. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2008), June 1-6, pp. 162\u2013168. IEEE Computer Society, Hong Kong (2008)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-79305-2_4","volume-title":"Artificial Evolution","author":"M. Bader-El-Den","year":"2008","unstructured":"Bader-El-Den, M., Poli, R.: Generating SAT local-search heuristics using a GP hyper-heuristic framework. In: Monmarch\u00e9, N., Talbi, E.-G., Collet, P., Schoenauer, M., Lutton, E. (eds.) EA 2007. LNCS, vol.\u00a04926, pp. 37\u201349. Springer, Heidelberg (2008)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-16242-8_9","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. Banbara","year":"2010","unstructured":"Banbara, M., Matsunaka, H., Tamura, N., Inoue, K.: Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 112\u2013126. Springer, Heidelberg (2010)"},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0004-3702(76)90011-4","volume":"7","author":"L. Beckman","year":"1976","unstructured":"Beckman, L., Haraldson, A., Oskarsson, O., Sandewall, E.: A partial evaluator, and its use as a programming tool. Artificial Intelligence\u00a07(4), 319\u2013357 (1976)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00165-005-0077-6","volume":"18","author":"D. Binkley","year":"2006","unstructured":"Binkley, D., Danicic, S., Harman, M., Howroyd, J., Ouarbya, L.: A formal relationship between program slicing and partial evaluation. Formal Aspects of Computing\u00a018(2), 103\u2013119 (2006)","journal-title":"Formal Aspects of Computing"},{"issue":"7","key":"12_CR7","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/32.605761","volume":"23","author":"D.M. Cohen","year":"1997","unstructured":"Cohen, D.M., Dalal, S.R., Fredman, M.L., Patton, G.C.: The AETG system: an approach to testing based on combinatorial design. IEEE Transactions on Software Engineering\u00a023(7), 437\u2013444 (1997)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"12_CR8","unstructured":"Colbourn, C.: Covering Array Tables (2013), http:\/\/www.public.asu.edu\/~ccolbou\/src\/tabby\/catable.html"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Fry, Z.P., Landau, B., Weimer, W.: A human study of patch maintainability. In: International Symposium on Software Testing and Analysis (ISSTA 2012), Minneapolis, Minnesota, USA (July 2012)","DOI":"10.1145\/2338965.2336775"},{"issue":"5","key":"12_CR11","first-page":"721","volume":"2","author":"Y. Futamura","year":"1971","unstructured":"Futamura, Y.: Partial evaluation of computation process \u2013 an approach to a compiler-compiler. Systems, Computers, Controls\u00a02(5), 721\u2013728 (1971)","journal-title":"Systems, Computers, Controls"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10664-010-9135-7","volume":"16","author":"B.J. Garvin","year":"2011","unstructured":"Garvin, B.J., Cohen, M.B., Dwyer, M.B.: Evaluating improvements to a meta-heuristic search for constrained interaction testing. Empirical Software Engineering\u00a016(1), 61\u2013102 (2011)","journal-title":"Empirical Software Engineering"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Goues, C.L., Dewey-Vogt, M., Forrest, S., Weimer, W.: A systematic study of automated program repair: Fixing 55 out of 105 bugs for $8 each. In: International Conference on Software Engineering (ICSE 2012), Zurich, Switzerland (2012)","DOI":"10.1109\/ICSE.2012.6227211"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Harman, M., Langdon, W.B., Jia, Y., White, D.R., Arcuri, A., Clark, J.A.: The GISMOE challenge: Constructing the Pareto program surface using genetic programming to find better programs (keynote paper). In: 27th IEEE\/ACM International Conference on Automated Software Engineering (ASE 2012), Essen, Germany (September 2012)","DOI":"10.1145\/2351676.2351678"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Harman, M., Langdon, W.B., Weimer, W.: Genetic programming for reverse engineering. In: Oliveto, R., Robbes, R. (eds.) 20th Working Conference on Reverse Engineering (WCRE 2013), October 14-17. IEEE, Koblenz (2013)","DOI":"10.1109\/WCRE.2013.6671274"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/11729976_30","volume-title":"Genetic Programming","author":"R.H. Kibria","year":"2006","unstructured":"Kibria, R.H., Li, Y.: Optimizing the initialization of dynamic decision heuristics in DPLL SAT solvers using genetic programming. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ek\u00e1rt, A. (eds.) EuroGP 2006. LNCS, vol.\u00a03905, pp. 331\u2013340. Springer, Heidelberg (2006)"},{"key":"12_CR17","unstructured":"Langdon, W.B., Harman, M.: Optimising existing software with genetic programming. IEEE Transactions on Evolutionary Computation (to appear)"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Langdon, W.B., Harman, M.: Evolving a CUDA kernel from an nVidia template. In: IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE (2010)","DOI":"10.1109\/CEC.2010.5585922"},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s11219-013-9208-0","volume":"21","author":"C. Goues Le","year":"2013","unstructured":"Le Goues, C., Forrest, S., Weimer, W.: Current challenges in automatic software repair. Software Quality Journal\u00a021(3), 421\u2013443 (2013)","journal-title":"Software Quality Journal"},{"issue":"3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/stvr.381","volume":"18","author":"Y. Lei","year":"2008","unstructured":"Lei, Y., Kacker, R., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG\/IPOG-D: efficient test generation for multi-way combinatorial testing. Softw. Test., Verif. Reliab.\u00a018(3), 125\u2013148 (2008)","journal-title":"Softw. Test., Verif. Reliab."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Nanba, T., Tsuchiya, T., Kikuno, T.: Constructing test sets for pairwise testing: A SAT-based approach. In: ICNC, pp. 271\u2013274. IEEE Computer Society (2011)","DOI":"10.1109\/ICNC.2011.49"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Nie, C., Leung, H.: A survey of combinatorial testing. ACM Computing Surveys\u00a043(2), 11:1\u201311:29 (2011)","DOI":"10.1145\/1883612.1883618"},{"issue":"2","key":"12_CR23","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/TEVC.2010.2052622","volume":"15","author":"M. Orlov","year":"2011","unstructured":"Orlov, M., Sipper, M.: Flight of the FINCH through the Java wilderness. IEEE Transactions on Evolutionary Computation\u00a015(2), 166\u2013182 (2011)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Petke, J., Cohen, M.B., Harman, M., Yoo, S.: Efficiency and early fault detection with lower and higher strength combinatorial interaction testing. In: European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, ESEC\/FSE 2013, pp. 26\u201336. ACM, Saint Petersburg (2013)","DOI":"10.1145\/2491411.2491436"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-39742-4_21","volume-title":"Search Based Software Engineering","author":"J. Petke","year":"2013","unstructured":"Petke, J., Langdon, W.B., Harman, M.: Applying genetic improvement to MiniSAT. In: Ruhe, G., Zhang, Y. (eds.) SSBSE 2013. LNCS, vol.\u00a08084, pp. 257\u2013262. Springer, Heidelberg (2013)"},{"key":"12_CR26","unstructured":"Silva, J.P.M., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 131\u2013153. IOS Press (2009)"},{"issue":"6","key":"12_CR27","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1145\/2070781.2024186","volume":"30","author":"P. Sitthi-amorn","year":"2011","unstructured":"Sitthi-amorn, P., Modly, N., Weimer, W., Lawrence, J.: Genetic programming for shader simplification. ACM Trans. Graph.\u00a030(6), 152 (2011)","journal-title":"ACM Trans. Graph."},{"key":"12_CR28","first-page":"1775","volume-title":"2008 Genetic and Evolutionary Computation Conference (GECCO 2008)","author":"D.R. White","year":"2008","unstructured":"White, D.R., Clark, J., Jacob, J., Poulding, S.: Searching for resource-efficient programs: Low-power pseudorandom number generators. In: 2008 Genetic and Evolutionary Computation Conference (GECCO 2008), pp. 1775\u20131782. ACM Press, Atlanta (2008)"},{"issue":"4","key":"12_CR29","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TEVC.2010.2083669","volume":"15","author":"D.R. White","year":"2011","unstructured":"White, D.R., Arcuri, A., Clark, J.A.: Evolutionary improvement of programs. IEEE Transactions on Evolutionary Computation\u00a015(4), 515\u2013538 (2011)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"12_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/3-540-48166-4_16","volume-title":"Software Engineering - ESEC\/FSE \u201999","author":"A. Zeller","year":"1999","unstructured":"Zeller, A.: Yesterday, my program worked. Today, it does not. Why? In: Wang, J., Lemoine, M. (eds.) ESEC 1999 and ESEC-FSE 1999. LNCS, vol.\u00a01687, pp. 253\u2013267. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44303-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T00:45:15Z","timestamp":1565743515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44303-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662443026","9783662443033"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44303-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}