{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:08:46Z","timestamp":1776305326162,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,9,15]],"date-time":"2014-09-15T00:00:00Z","timestamp":1410739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,9,15]]},"DOI":"10.1145\/2642937.2643003","type":"proceedings-article","created":{"date-parts":[[2014,9,17]],"date-time":"2014-09-17T14:22:41Z","timestamp":1410963761000},"page":"259-270","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Evaluation of string constraint solvers in the context of symbolic execution"],"prefix":"10.1145","author":[{"given":"Scott","family":"Kausler","sequence":"first","affiliation":[{"name":"Boise State University, Boise, ID, USA"}]},{"given":"Elena","family":"Sherman","sequence":"additional","affiliation":[{"name":"Boise State University, Boise, ID, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,9,15]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Sourceforge. http:\/\/sourceforge.net\/.  Sourceforge. http:\/\/sourceforge.net\/."},{"key":"e_1_3_2_1_2_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/3-540-63174-7_2","volume-title":"Algorithms for guided tree automata","author":"Biehl M.","year":"1997","unstructured":"M. Biehl , N. Klarlund , and T. Rauhe . Algorithms for guided tree automata . In D. Raymond, D. Wood, and S. Yu, editors, Automata Implementation, volume 1260 of Lecture Notes in Computer Science , pages 6 -- 25 . Springer Berlin Heidelberg , 1997 . M. Biehl, N. Klarlund, and T. Rauhe. Algorithms for guided tree automata. In D. Raymond, D. Wood, and S. Yu, editors, Automata Implementation, volume 1260 of Lecture Notes in Computer Science, pages 6--25. Springer Berlin Heidelberg, 1997."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_27"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31491-9_19"},{"key":"e_1_3_2_1_5_1","first-page":"1","volume-title":"Software & Systems Modeling","author":"B\u00fcttner F.","year":"2013","unstructured":"F. B\u00fcttner and J. Cabot . Lightweight string reasoning in model finding . Software & Systems Modeling , pages 1 -- 15 , 2013 . F. B\u00fcttner and J. Cabot. Lightweight string reasoning in model finding. Software & Systems Modeling, pages 1--15, 2013."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11924661_23"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760267.1760269"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1976.233817"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/503209.503230"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993565"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2486788.2486925"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the Java Pathfinder Workshop","author":"Hillery B.","year":"2013","unstructured":"B. Hillery , E. Mercer , N. Rungta , and S. Person . Towards a lazier symbolic path finder . In Proceedings of the Java Pathfinder Workshop , 2013 . B. Hillery, E. Mercer, N. Rungta, and S. Person. Towards a lazier symbolic path finder. In Proceedings of the Java Pathfinder Workshop, 2013."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1946284.1946302"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542498"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859080"},{"key":"e_1_3_2_1_17_1","volume-title":"Evaluation of string constraint solvers using dynamic symbolic execution. Master's thesis","author":"Kausler S.","year":"2014","unstructured":"S. Kausler . Evaluation of string constraint solvers using dynamic symbolic execution. Master's thesis , Boise State University , USA , 2014 . S. Kausler. Evaluation of string constraint solvers using dynamic symbolic execution. Master's thesis, Boise State University, USA, 2014."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765871.1765924"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2377656.2377662"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360252"},{"key":"e_1_3_2_1_21_1","volume-title":"Informal proceedings, 7th International Workshop on Satisfiability Modulo Theories at CADE 22","author":"Kr\u00f6ning D.","year":"2009","unstructured":"D. Kr\u00f6ning , P. R\u00fcmmer , and G. Weissenbacher . A proposal for a theory of finite sets, lists, and maps for the smt-lib standard . In Informal proceedings, 7th International Workshop on Satisfiability Modulo Theories at CADE 22 , 2009 . D. Kr\u00f6ning, P. R\u00fcmmer, and G. Weissenbacher. A proposal for a theory of finite sets, lists, and maps for the smt-lib standard. In Informal proceedings, 7th International Workshop on Satisfiability Modulo Theories at CADE 22, 2009."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03077-7_2"},{"key":"e_1_3_2_1_23_1","volume-title":"Technical report, Department of Computer Science","author":"Liang T.","year":"2014","unstructured":"T. Liang , A. Reynolds , C. Tinelli , C. Barrett , and M. Deters . A dpll (t) theory solver for a theory of strings and regular expressions*. Technical report , Technical report, Department of Computer Science , The University of Iowa , 2014 .(Available at http:\/\/cvc4. cs. nyu. edu\/papers\/CAV2014-strings\/). T. Liang, A. Reynolds, C. Tinelli, C. Barrett, and M. Deters. A dpll (t) theory solver for a theory of strings and regular expressions*. Technical report, Technical report, Department of Computer Science, The University of Iowa, 2014.(Available at http:\/\/cvc4. cs. nyu. edu\/papers\/CAV2014-strings\/)."},{"key":"e_1_3_2_1_24_1","unstructured":"A. M\u00fcller. dk.brics.automaton. http:\/\/www.brics.dk\/automaton.  A. M\u00fcller. dk.brics.automaton. http:\/\/www.brics.dk\/automaton."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/62959.62964"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859035"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2389836.2389853"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2010.38"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081706.1081750"},{"key":"e_1_3_2_1_30_1","first-page":"13","volume-title":"Testing: Academic and Industrial Conference Practice and Research Techniques-MUTATION, 2007","author":"Shannon D.","year":"2007","unstructured":"D. Shannon , S. Hajra , A. Lee , D. Zhan , and S. Khurshid . Abstracting symbolic execution with string analysis . In Testing: Academic and Industrial Conference Practice and Research Techniques-MUTATION, 2007 . TAICPART-MUTATION 2007 , pages 13 -- 22 . IEEE, 2007. D. Shannon, S. Hajra, A. Lee, D. Zhan, and S. Khurshid. Abstracting symbolic execution with string analysis. In Testing: Academic and Industrial Conference Practice and Research Techniques-MUTATION, 2007. TAICPART-MUTATION 2007, pages 13--22. IEEE, 2007."},{"key":"e_1_3_2_1_31_1","volume-title":"SMTEVAL 2013:progress report. http:\/\/sat2013","author":"Stump A.","year":"2013","unstructured":"A. Stump , T. Weber , and D. Cok . SMTEVAL 2013:progress report. http:\/\/sat2013 .cs.helsinki.fi\/slides\/SMTEVAL 2013 .pdf. A. Stump, T. Weber, and D. Cok. SMTEVAL 2013:progress report. http:\/\/sat2013.cs.helsinki.fi\/slides\/SMTEVAL2013.pdf."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1925805.1925818"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2010.15"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12002-2_13"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-013-0189-1"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85114-1_21"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_28"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491456"}],"event":{"name":"ASE '14: ACM\/IEEE International Conference on Automated Software Engineering","location":"Vasteras Sweden","acronym":"ASE '14","sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence","SIGSOFT ACM Special Interest Group on Software Engineering","M\u00e4lardalen University M\u00e4lardalen University","IEEE CS"]},"container-title":["Proceedings of the 29th ACM\/IEEE International Conference on Automated Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2642937.2643003","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2642937.2643003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:56:09Z","timestamp":1750229769000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2642937.2643003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,15]]},"references-count":38,"alternative-id":["10.1145\/2642937.2643003","10.1145\/2642937"],"URL":"https:\/\/doi.org\/10.1145\/2642937.2643003","relation":{},"subject":[],"published":{"date-parts":[[2014,9,15]]},"assertion":[{"value":"2014-09-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}