{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:11:16Z","timestamp":1774987876076,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,19]],"date-time":"2009-07-19T00:00:00Z","timestamp":1247961600000},"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":[[2009,7,19]]},"DOI":"10.1145\/1572272.1572286","type":"proceedings-article","created":{"date-parts":[[2009,7,28]],"date-time":"2009-07-28T12:45:28Z","timestamp":1248785128000},"page":"105-116","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":153,"title":["HAMPI"],"prefix":"10.1145","author":[{"given":"Adam","family":"Kiezun","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay","family":"Ganesh","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip J.","family":"Guo","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pieter","family":"Hooimeijer","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael D.","family":"Ernst","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,7,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_34"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11527695_5"},{"key":"e_1_3_2_1_3_1","volume-title":"Advances in Computers","author":"Biere A.","year":"2003","unstructured":"A. Biere , A. Cimatti , E. Clarke , O. Strichman , and Y. Zhu . Bounded model checking . Advances in Computers , 2003 . A. Biere, A. Cimatti, E. Clarke, O. Strichman, and Y. Zhu. Bounded model checking. Advances in Computers, 2003."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_27"},{"key":"e_1_3_2_1_5_1","volume-title":"OSDI","author":"Cadar C.","year":"2008","unstructured":"C. Cadar , D. Dunbar , and D. R. Engler . Klee: Unassisted and automatic generation of high-coverage tests for complex systems programs . In OSDI , 2008 . C. Cadar, D. Dunbar, and D. R. Engler. Klee: Unassisted and automatic generation of high-coverage tests for complex systems programs. In OSDI, 2008."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180445"},{"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.1007\/978-3-540-24730-2_15"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273463.1273484"},{"key":"e_1_3_2_1_11_1","unstructured":"Brics finite state automata utilities. http:\/\/www.brics.dk\/automaton\/faq.html.  Brics finite state automata utilities. http:\/\/www.brics.dk\/automaton\/faq.html."},{"key":"e_1_3_2_1_12_1","unstructured":"Finite state automata utilities. http:\/\/www.let.rug.nl\/~vannoord\/Fsa\/fsa.html.  Finite state automata utilities. http:\/\/www.let.rug.nl\/~vannoord\/Fsa\/fsa.html."},{"key":"e_1_3_2_1_13_1","unstructured":"AT&T FSM library. http:\/\/www.research.att.com\/~fsmtools\/fsm.  AT&T FSM library. http:\/\/www.research.att.com\/~fsmtools\/fsm."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2007.43"},{"key":"e_1_3_2_1_15_1","volume-title":"CAV","author":"Ganesh V.","year":"2007","unstructured":"V. Ganesh and D. L. Dill . A decision procedure for bit-vectors and arrays . In CAV , 2007 . V. Ganesh and D. L. Dill. A decision procedure for bit-vectors and arrays. In CAV, 2007."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375607"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065036"},{"key":"e_1_3_2_1_18_1","volume-title":"NDSS","author":"Godefroid P.","year":"2008","unstructured":"P. Godefroid , M. Y. Levin , and D. Molnar . Automated whitebox fuzz testing . In NDSS , 2008 . P. Godefroid, M. Y. Levin, and D. Molnar. Automated whitebox fuzz testing. In NDSS, 2008."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375616"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2007.70748"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542498"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/347324.383378"},{"key":"e_1_3_2_1_23_1","volume-title":"NFM","author":"Jayaraman K.","year":"2009","unstructured":"K. Jayaraman , D. Harvison , V. Ganesh , and A. Kie|un. j Fuzz : A concolic whitebox fuzzer for Java . In NFM , 2009 . K. Jayaraman, D. Harvison, V. Ganesh, and A. Kie|un. jFuzz: A concolic whitebox fuzzer for Java. In NFM, 2009."},{"key":"e_1_3_2_1_24_1","volume-title":"ICSE","author":"A.","year":"2009","unstructured":"A. Kie|un, P. J. Guo , K. Jayaraman , and M. D. Ernst . Automatic creation of SQL injection and cross-site scripting attacks . In ICSE , 2009 . A. Kie|un, P. J. Guo, K. Jayaraman, and M. D. Ernst. Automatic creation of SQL injection and cross-site scripting attacks. In ICSE, 2009."},{"key":"e_1_3_2_1_25_1","volume-title":"WCSL","author":"Klarlund N.","year":"1998","unstructured":"N. Klarlund . Mona&Fido : The logic-automaton connection in practice . In WCSL , 1998 . N. Klarlund. Mona&Fido: The logic-automaton connection in practice. In WCSL, 1998."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321653"},{"key":"e_1_3_2_1_27_1","volume-title":"The problem of solvability of equations in a free semigroup. Sbornik: Mathematics, 32(2)","author":"Makanin G.","year":"1977","unstructured":"G. Makanin . The problem of solvability of equations in a free semigroup. Sbornik: Mathematics, 32(2) , 1977 . G. Makanin. The problem of solvability of equations in a free semigroup. Sbornik: Mathematics, 32(2), 1977."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060809"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"e_1_3_2_1_30_1","volume-title":"CP","author":"Pesant G.","year":"2004","unstructured":"G. Pesant . A regular language membership constraint for finite sequences of variables . In CP , 2004 . G. Pesant. A regular language membership constraint for finite sequences of variables. In CP, 2004."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11889205_64"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/645814.668872"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2008.25"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081706.1081750"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1308173.1308254"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/524279"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250739"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368112"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390630.1390661"},{"key":"e_1_3_2_1_40_1","volume-title":"CAV","author":"Xie Y.","year":"2007","unstructured":"Y. Xie and A. Aiken . Saturn: A scalable framework for error detection using Boolean satisfiability . In CAV , 2007 . Y. Xie and A. Aiken. Saturn: A scalable framework for error detection using Boolean satisfiability. In CAV, 2007."}],"event":{"name":"ISSTA '09: International Symposium on Software Testing and Analysis","location":"Chicago IL USA","acronym":"ISSTA '09","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGSOFT ACM Special Interest Group on Software Engineering"]},"container-title":["Proceedings of the eighteenth international symposium on Software testing and analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1572272.1572286","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1572272.1572286","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:29Z","timestamp":1750249409000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1572272.1572286"}},"subtitle":["a solver for string constraints"],"short-title":[],"issued":{"date-parts":[[2009,7,19]]},"references-count":40,"alternative-id":["10.1145\/1572272.1572286","10.1145\/1572272"],"URL":"https:\/\/doi.org\/10.1145\/1572272.1572286","relation":{},"subject":[],"published":{"date-parts":[[2009,7,19]]},"assertion":[{"value":"2009-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}