{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:45:24Z","timestamp":1743093924030,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030684457"},{"type":"electronic","value":"9783030684464"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-68446-4_10","type":"book-chapter","created":{"date-parts":[[2021,2,12]],"date-time":"2021-02-12T19:06:39Z","timestamp":1613156799000},"page":"192-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithm Selection for Dynamic Symbolic Execution: A Preliminary Study"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Amadini","sequence":"first","affiliation":[]},{"given":"Graeme","family":"Gange","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Schachte","sequence":"additional","affiliation":[]},{"given":"Harald","family":"S\u00f8ndergaard","sequence":"additional","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,13]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-19212-9_1","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"R Amadini","year":"2019","unstructured":"Amadini, R., Andrlon, M., Gange, G., Schachte, P., \u00a0S\u00f8ndergaard, H., Stuckey, P.J.: Constraint programming for dynamic symbolic execution of javascript. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 1\u201319. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_1"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Amadini, R., Gabbrielli, M., Mauro, J.: An enhanced features extractor for a portfolio of constraint solvers. In: Proceedings 29th Annual ACM Symposium Applied Computing, pp. 1357\u20131359. ACM (2014)","DOI":"10.1145\/2554850.2555114"},{"issue":"4\u20135","key":"10_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1017\/S1471068414000179","volume":"14","author":"R Amadini","year":"2014","unstructured":"Amadini, R., Gabbrielli, M., Mauro, J.: SUNNY: a lazy portfolio approach for constraint solving. Theory Pract. Logic Program. 14(4\u20135), 509\u2013524 (2014)","journal-title":"Theory Pract. Logic Program."},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-319-27436-2_21","volume-title":"Logic-Based Program Synthesis and Transformation","author":"R Amadini","year":"2015","unstructured":"Amadini, R., Gabbrielli, M., Mauro, J.: Why CP portfolio solvers are (under)utilized? issues and challenges. In: Falaschi, M. (ed.) LOPSTR 2015. LNCS, vol. 9527, pp. 349\u2013364. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27436-2_21"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Amadini, R., Gange, G., Stuckey, P.J.: Sweep-based propagation for string constraint solving. In: Proceedings of 32nd AAAI Conference Artificial Intelligence, pp. 6557\u20136564. AAAI (2018)","DOI":"10.1609\/aaai.v32i1.12201"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-319-10428-7_11","volume-title":"Principles and Practice of Constraint Programming","author":"R Amadini","year":"2014","unstructured":"Amadini, R., Stuckey, P.J.: Sequential time splitting and bounds communication for a portfolio of optimization solvers. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 108\u2013124. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_11"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TSE.2010.31","volume":"36","author":"S Artzi","year":"2010","unstructured":"Artzi, S., et al.: Finding bugs in web applications using dynamic test generation and explicit-state model checking. IEEE Trans. Softw. Eng. 36(4), 474\u2013494 (2010)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10_CR8","unstructured":"Cadar, C., Dunbar, D., Engler, D.: KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs. In: Proceedings of 8th USENIX Conference Operating Systems Design and Implementation, OSDI, vol. 8, pp. 209\u2013224 (2008)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: DART: directed automated random testing. In: Proceedings of ACM SIGPLAN Conference Programming Language Design and Implementation (PLDI 2005), pp. 213\u2013223. ACM (2005)","DOI":"10.1145\/1064978.1065036"},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/2093548.2093564","volume":"55","author":"P Godefroid","year":"2012","unstructured":"Godefroid, P., Levin, M.Y., Molnar, D.: SAGE: whitebox fuzzing for security testing. Commun. ACM 55(3), 40\u201344 (2012)","journal-title":"Commun. ACM"},{"issue":"4\u20135","key":"10_CR11","first-page":"569","volume":"14","author":"H Hoos","year":"2014","unstructured":"Hoos, H., Lindauer, M.T., Schaub, T.: Claspfolio 2: advances in algorithm selection for answer set programming. TPLP 14(4\u20135), 569\u2013585 (2014)","journal-title":"TPLP"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-319-07046-9_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"B Hurley","year":"2014","unstructured":"Hurley, B., Kotthoff, L., Malitsky, Y., O\u2019Sullivan, B.: Proteus: a hierarchical portfolio of solvers and transformations. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 301\u2013317. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07046-9_22"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods and evaluation. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"key":"10_CR14","unstructured":"Istanbul Team: Istanbul website (2020). https:\/\/istanbul.js.org"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-642-23786-7_35","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"S Kadioglu","year":"2011","unstructured":"Kadioglu, S., Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm selection and scheduling. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 454\u2013469. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23786-7_35"},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/evco_a_00242","volume":"27","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Hoos, H.H., Neumann, F., Trautmann, H.: Automated algorithm selection: survey and perspectives. Evol. Comput. 27(1), 3\u201345 (2019)","journal-title":"Evol. Comput."},{"issue":"7","key":"10_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"JC King","year":"1976","unstructured":"King, J.C.: Symbolic execution and program testing. Commun. ACM 19(7), 385\u2013394 (1976)","journal-title":"Commun. ACM"},{"issue":"3","key":"10_CR18","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1609\/aimag.v35i3.2460","volume":"35","author":"L Kotthoff","year":"2014","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: A survey. AI Mag. 35(3), 48\u201360 (2014)","journal-title":"AI Mag."},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/978-3-319-08867-9_43","volume-title":"Computer Aided Verification","author":"T Liang","year":"2014","unstructured":"Liang, T., Reynolds, A., Tinelli, C., Barrett, C., Deters, M.: A DPLL(T) theory solver for a theory of strings and regular expressions. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 646\u2013662. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_43"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-319-50349-3_20","volume-title":"Learning and Intelligent Optimization","author":"M Lindauer","year":"2016","unstructured":"Lindauer, M., Bergdoll, R.-D., Hutter, F.: An empirical study of per-instance algorithm scheduling. In: Festa, P., Sellmann, M., Vanschoren, J. (eds.) LION 2016. LNCS, vol. 10079, pp. 253\u2013259. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50349-3_20"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Loring, B., Mitchell, D., Kinder, J.: ExpoSE: practical symbolic execution of standalone JavaScript. In: Proceedings of 24th ACM SIGSOFT International SPIN Symposium Model Checking of Software, pp. 196\u2013199. ACM (2017)","DOI":"10.1145\/3092282.3092295"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Majumdar, R., Sen, K.: Hybrid concolic testing. In: Proceedings of 29th International Conference Software Engineering (ICSE 2007), pp. 416\u2013426. IEEE (2007)","DOI":"10.1109\/ICSE.2007.41"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-642-02658-4_41","volume-title":"Computer Aided Verification","author":"R Majumdar","year":"2009","unstructured":"Majumdar, R., Xu, R.-G.: Reducing test inputs using information partitions. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 555\u2013569. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_41"},{"key":"10_CR24","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm portfolios based on cost-sensitive hierarchical clustering. In: Proceedings of 23rd International Joint Conference Artificial Intelligence. IJCAI\/AAAI (2013)"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-39799-8_3","volume-title":"Computer Aided Verification","author":"H Palikareva","year":"2013","unstructured":"Palikareva, H., Cadar, C.: Multi-solver support in symbolic execution. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 53\u201368. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_3"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Saxena, P., Akhawe, D., Hanna, S., Mao, F., McCamant, S., Song, D.: A symbolic execution framework for JavaScript. In: Proceedings of 2010 IEEE Symposium Security and Privacy, pp. 513\u2013528. IEEE Computer Society (2010)","DOI":"10.1109\/SP.2010.38"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Schwartz, E.J., Avgerinos, T., Brumley, D.: All you ever wanted to know about dynamic taint analysis and forward symbolic execution (but might have been afraid to ask). In: Proceedings of 31st IEEE Symposium on Security and Privacy, pp. 317\u2013331 (2010)","DOI":"10.1109\/SP.2010.26"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/11817963_38","volume-title":"Computer Aided Verification","author":"K Sen","year":"2006","unstructured":"Sen, K., Agha, G.: CUTE and jCUTE: concolic unit testing and explicit path model-checking tools. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 419\u2013423. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817963_38"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Sen, K., Kalasapur, S., Brutch, T.G., Gibbs, S.: Jalangi: a selective record-replay and dynamic analysis framework for JavaScript. In: Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium Foundations of Software Engineering, pp. 488\u2013498 (2013)","DOI":"10.1145\/2491411.2491447"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Sen, K., Marinov, D., Agha, G.: CUTE: A concolic unit testing engine for C. In: Proceedings of 10th European Software Engineering Conference, pp. 263\u2013272. ACM (2005)","DOI":"10.1145\/1095430.1081750"},{"issue":"1","key":"10_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1456650.1456656","volume":"41","author":"K Smith-Miles","year":"2008","unstructured":"Smith-Miles, K.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41(1), 1\u201325 (2008)","journal-title":"ACM Comput. Surv."},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-79124-9_10","volume-title":"Tests and Proofs","author":"N Tillmann","year":"2008","unstructured":"Tillmann, N., de Halleux, J.: Pex\u2013white box test generation for.NET. In: Beckert, B., H\u00e4hnle, R. (eds.) TAP 2008. LNCS, vol. 4966, pp. 134\u2013153. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79124-9_10"},{"key":"10_CR35","unstructured":"Valenzano, R.A., Nakhost, H., M\u00fcller, M., Schaeffer, J., Sturtevant, N.R.: ArvandHerd: parallel planning with a portfolio. In: European Conference Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 242, pp. 786\u2013791. IOS Press (2012)"},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-31612-8_18","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"L Xu","year":"2012","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Evaluating component solver contributions to portfolio-based algorithm selectors. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 228\u2013241. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31612-8_18"},{"key":"10_CR37","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: Portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68446-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T02:10:00Z","timestamp":1671243000000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68446-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030684457","9783030684464"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68446-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"13 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bologna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nms.kcl.ac.uk\/maribel.fernandez\/LOPSTR2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition, two invited talks are included in the proceedings. Due to the COVID-19 pandemic the conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}