{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:37:38Z","timestamp":1766579858393,"version":"3.37.3"},"reference-count":97,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IIEEE Trans. Software Eng."],"published-print":{"date-parts":[[2018,6,1]]},"DOI":"10.1109\/tse.2017.2702606","type":"journal-article","created":{"date-parts":[[2017,6,29]],"date-time":"2017-06-29T19:23:12Z","timestamp":1498764192000},"page":"574-594","source":"Crossref","is-referenced-by-count":37,"title":["Specialising Software for Different Downstream Applications Using Genetic Improvement and Code Transplantation"],"prefix":"10.1109","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7833-6044","authenticated-orcid":false,"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":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2011.49"},{"key":"ref38","first-page":"112","article-title":"Generating combinatorial test cases by\n efficient SAT encodings suitable for CDCL SAT solvers","author":"banbara","year":"2010","journal-title":"Proc 17th Int Conf Logic Program Artif Intell Reasoning"},{"key":"ref33","first-page":"75","article-title":"CNF encodings","author":"prestwich","year":"2009","journal-title":"Handbook of Satisfiability"},{"key":"ref32","first-page":"253","article-title":"Yesterday, my program worked. Today, it does not. Why?","author":"zeller","year":"1999","journal-title":"Proc 7th Eur Softw Eng Conf Held Jointly 7th ACM SIGSOFT Int Symp Found Softw Eng"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2012.6227211"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2013.6671274"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-3-642-33119-0_5","article-title":"On the\n application of SAT solvers to the test suite minimization problem","author":"arito","year":"2012","journal-title":"Proc Int'l Symp Search Based Software Eng"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.923410"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2455034"},{"key":"ref34","volume":"185","author":"biere","year":"2009","journal-title":"Handbook of Satisfiability"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2011.104"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-540-89694-4_7","article-title":"Multi-objective improvement of software\n using co-evolution and smart seeding","author":"arcuri","year":"2008","journal-title":"Proc 7th Int Conf Simulated Evol Learn"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2015.7102580"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(76)90011-4"},{"key":"ref22","first-page":"721","article-title":"Partial evaluation of computation process-an approach to a\n compiler-compiler","volume":"2","author":"futamura","year":"1971","journal-title":"Syst Comput Controls"},{"key":"ref21","first-page":"391","author":"ershov","year":"1978","journal-title":"The Essence of Computation"},{"key":"ref24","first-page":"133","article-title":"Generalized partial computation","author":"futamura","year":"1987","journal-title":"Proc IFIP TC2 Workshop Partial Eval Mixed Comput"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512781"},{"journal-title":"Genetic Programming-On the Programming of Computers by Means of Natural Selection","year":"1993","author":"koza","key":"ref26"},{"journal-title":"A Field Guide to Genetic Programming","year":"2008","author":"poli","key":"ref25"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.381"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491436"},{"key":"ref59","doi-asserted-by":"crossref","first-page":"1375","DOI":"10.1145\/2739480.2754648","article-title":"Deep parameter optimisation","author":"wu","year":"2015","journal-title":"Proc Genetic Evol Comput Conf"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/1882291.1882315"},{"key":"ref57","first-page":"1","article-title":"Search based software engineering:\n Techniques, taxonomy, tutorial","author":"harman","year":"2012","journal-title":"Empirical Software Engineering and Verification LASER 2009-2010"},{"key":"ref56","first-page":"369","article-title":"Finding efficient\n circuits for ensemble computation","author":"j\u00e4rvisalo","year":"2012","journal-title":"Proc Int Conf Theory and Appl Satisfiability Testing"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref55"},{"article-title":"SAT-based termination analysis for Java bytecode with AProVE","year":"2011","author":"fuhs","key":"ref54"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-010-9211-0"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2015.7102599"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11219-013-9208-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5585922"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389437"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2052622"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-010-9135-7"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2083669"},{"key":"ref9","first-page":"137","article-title":"Using genetic improvement\n and code transplants to specialise a C++ program to a problem class","author":"petke","year":"2014","journal-title":"Proc 17th Eur Conf Gen Program"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1883612.1883618"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754752"},{"article-title":"Covering array tables","year":"2013","author":"colbourn","key":"ref48"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/32.605761"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.01.001"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2014.2327020"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/WODES.2008.4605925"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2015.77"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1145\/2648511.2648513"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2010.06.001"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69062-7_8"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55035-5_15"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33119-0_2"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1007\/s11219-016-9309-7"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2009.52"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.294"},{"key":"ref78","first-page":"1263","article-title":"High dimensional search-based software engineering:\n Finding tradeoffs among 15 objectives for automating software refactoring using NSGA-III","author":"mkaouer","year":"2014","journal-title":"Proc Genetic Evol Comput Conf"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1145\/2932631"},{"key":"ref60","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1145\/2739480.2754652","article-title":"Improving CUDA DNA analysis software with\n genetic programming","author":"langdon","year":"2015","journal-title":"Proc Genetic Evol Comput Conf"},{"key":"ref62","first-page":"410","article-title":"The community structure of SAT formulas","author":"ans\u00f3tegui","year":"2012","journal-title":"Proc Int Conf Theory and Appl Satisfiability Testing"},{"key":"ref61","first-page":"1173","article-title":"Backdoors\n to typical case complexity","author":"williams","year":"2003","journal-title":"Proc 18th Int Joint Conf Artif Intell"},{"key":"ref63","first-page":"252","article-title":"Impact of community structure on SAT solver performance","author":"newsham","year":"2014","journal-title":"Proc 17th Int Conf Held Part Vienna Summer Logic Theory Appl Satisfiability Testing"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635898"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2011.263"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2012.07.041"},{"key":"ref67","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/978-3-642-23716-4_5","article-title":"Ten years of search based software engineering: A bibliometric analysis","author":"freitas","year":"2011","journal-title":"Proc Int'l Symp Search Based Software Eng"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(01)00189-6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281544"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/2379776.2379787"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2351676.2351678"},{"key":"ref95","first-page":"503","article-title":"SEEDS: A software engineer&#x2019;s energy-optimization decision support\n framework","author":"manotas-guti\u00e9rrez","year":"2014","journal-title":"Proc 36th Int Conf Softw Eng"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568321"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2013.6671293"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2016.11.007"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1145\/2002962.2002970"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985804"},{"key":"ref96","first-page":"24","article-title":"Applying genetic improvement to MiniSAT","author":"petke","year":"2013","journal-title":"Proc Int'l Symp Search Based Software Eng"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2014.2372785"},{"key":"ref10","first-page":"131","article-title":"Conflict-driven clause learning SAT solvers","author":"silva","year":"2009","journal-title":"Handbook of Satisfiability"},{"year":"2009","key":"ref11","article-title":"MiniSAT-hack track of SAT competition"},{"journal-title":"Partial Evaluation and Mixed Computation","year":"1987","author":"bj\u00f8rner","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-005-0077-6"},{"journal-title":"Partial Evaluation and Automatic Program Generation","year":"1993","author":"jones","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/289121.289141"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/289121.289142"},{"key":"ref82","first-page":"87","article-title":"Genetically improved CUDA C++ software","author":"langdon","year":"2014","journal-title":"Proc 17th Eur Conf Gen Program"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/289121.289143"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598244"},{"key":"ref18","first-page":"1139","article-title":"Compiler generation by partial evaluation","author":"gomard","year":"1989","journal-title":"Proc 11th IFIP World Comput Congr Inf Process"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20883-1_8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1882362.1882380"},{"key":"ref83","doi-asserted-by":"crossref","first-page":"152:1","DOI":"10.1145\/2070781.2024186","article-title":"Genetic programming for shader\n simplification","volume":"30","author":"sitthi-amorn","year":"2011","journal-title":"ACM Trans Graph"},{"key":"ref80","first-page":"7","article-title":"Why source code analysis and manipulation will always be important\n (keynote)","author":"harman","year":"2010","journal-title":"Proc 10th IEEE Int Work Conf Source Code Anal Manipulation"},{"key":"ref89","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1145\/2771783.2771796","article-title":"Automated software transplantation","author":"barr","year":"2015","journal-title":"Proc Int'l Symp on Softw Testing and Analysis"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1145\/2541940.2541980"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09940-8_20"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1145\/2739482.2768418"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22183-0_22"}],"container-title":["IEEE Transactions on Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/32\/8383624\/07962212.pdf?arnumber=7962212","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T05:29:27Z","timestamp":1643174967000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7962212\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,1]]},"references-count":97,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tse.2017.2702606","relation":{},"ISSN":["0098-5589","1939-3520"],"issn-type":[{"type":"print","value":"0098-5589"},{"type":"electronic","value":"1939-3520"}],"subject":[],"published":{"date-parts":[[2018,6,1]]}}}