{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:11:45Z","timestamp":1775873505105,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T00:00:00Z","timestamp":1389139200000},"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,1,8]]},"DOI":"10.1145\/2535838.2535857","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T08:40:06Z","timestamp":1389688806000},"page":"607-618","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":79,"title":["Symbolic optimization with SMT solvers"],"prefix":"10.1145","author":[{"given":"Yi","family":"Li","sequence":"first","affiliation":[{"name":"University of Toronto, Toronto, ON, Canada"}]},{"given":"Aws","family":"Albarghouthi","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, ON, Canada"}]},{"given":"Zachary","family":"Kincaid","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, ON, Canada"}]},{"given":"Arie","family":"Gurfinkel","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, ON, USA"}]},{"given":"Marsha","family":"Chechik","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2014,1,8]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Competition On Software Verification - (SV-COMP). http:\/\/sv-comp.sosy-lab.org.  Competition On Software Verification - (SV-COMP). http:\/\/sv-comp.sosy-lab.org."},{"key":"e_1_3_2_2_2_1","unstructured":"Yices SMT Solver. http:\/\/yices.csl.sri.com.  Yices SMT Solver. http:\/\/yices.csl.sri.com."},{"key":"e_1_3_2_2_3_1","unstructured":"Z3 Source Code Repository. http:\/\/z3.codeplex.com\/.  Z3 Source Code Repository. http:\/\/z3.codeplex.com\/."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2958031.2958099"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_48"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00136-X"},{"key":"e_1_3_2_2_7_1","series-title":"LNCS","first-page":"260","volume-title":"Proc. of CAV'01","author":"Ball T.","year":"2001","unstructured":"T. Ball and S. Rajamani . The SLAM Toolkit . In Proc. of CAV'01 , volume 2102 of LNCS , pages 260 -- 264 , 2001 . T. Ball and S. Rajamani. The SLAM Toolkit. In Proc. of CAV'01, volume 2102 of LNCS, pages 260--264, 2001."},{"key":"e_1_3_2_2_8_1","volume-title":"Department of Computer Science","author":"Barrett C.","year":"2010","unstructured":"C. Barrett , A. Stump , and C. Tinelli . The SMT-LIB Standard: Version 2.0. Technical report , Department of Computer Science , The University of Iowa , 2010 . Available at www.SMT-LIB.org. C. Barrett, A. Stump, and C. Tinelli. The SMT-LIB Standard: Version 2.0. Technical report, Department of Computer Science, The University of Iowa, 2010. Available at www.SMT-LIB.org."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2032305.2032319"},{"key":"e_1_3_2_2_10_1","first-page":"825","volume-title":"Handbook of Satisfiability","author":"Barrett C.W.","year":"2009","unstructured":"C.W. Barrett , R. Sebastiani , S. A. Seshia , and C. Tinelli . Satisfiability modulo theories . In Handbook of Satisfiability , pages 825 -- 885 . 2009 . C.W. Barrett, R. Sebastiani, S. A. Seshia, and C. Tinelli. Satisfiability modulo theories. In Handbook of Satisfiability, pages 825--885. 2009."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2009.5351147"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796812000032"},{"key":"e_1_3_2_2_14_1","volume-title":"Proc. of SMT'12","author":"Bjorner N.","year":"2012","unstructured":"N. Bjorner , K. McMillan , and A. Rybalchenko . Program Verification as Satisfiability Modulo Theories . In Proc. of SMT'12 , 2012 . N. Bjorner, K. McMillan, and A. Rybalchenko. Program Verification as Satisfiability Modulo Theories. In Proc. of SMT'12, 2012."},{"key":"e_1_3_2_2_15_1","first-page":"209","volume-title":"Proc. of OSDI'08","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 Proc. of OSDI'08 , pages 209 -- 224 , 2008 . C. Cadar, D. Dunbar, and D. R. Engler. KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. In Proc. of OSDI'08, pages 209--224, 2008."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2958031.2958109"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12002-2_8"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36742-7_7"},{"key":"e_1_3_2_2_19_1","series-title":"LNCS","first-page":"168","volume-title":"Proc. of TACAS'04","author":"Clarke E.","year":"2004","unstructured":"E. Clarke , D. Kroening , and F. Lerda . A Tool for Checking ANSI-C Programs . In Proc. of TACAS'04 , volume 2988 of LNCS , pages 168 -- 176 , March 2004 . E. Clarke, D. Kroening, and F. Lerda. A Tool for Checking ANSI-C Programs. In Proc. of TACAS'04, volume 2988 of LNCS, pages 168--176, March 2004."},{"key":"e_1_3_2_2_20_1","volume-title":"Proc. of the Colloque sur la Programmation","author":"Cousot P.","year":"1976","unstructured":"P. Cousot and R. Cousot . Static Determination of Dynamic Properties of Programs . In Proc. of the Colloque sur la Programmation , 1976 . P. Cousot and R. Cousot. Static Determination of Dynamic Properties of Programs. In Proc. of the Colloque sur la Programmation, 1976."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_2_23_1","volume-title":"Microsoft Research","author":"DeLine R.","year":"2005","unstructured":"R. DeLine and K. R. M. Leino . BoogiePL : A Typed Procedural Language for Checking Object-oriented Programs. Technical report , Microsoft Research , 2005 . R. DeLine and K. R. M. Leino. BoogiePL: A Typed Procedural Language for Checking Object-oriented Programs. Technical report, Microsoft Research, 2005."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_11"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36742-7_48"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27813-9_14"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065036"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2093548.2093564"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1958-10224-4"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254112"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993506"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25318-8_16"},{"key":"e_1_3_2_2_33_1","series-title":"LNCS","first-page":"131","volume-title":"Proc. of NFM'11","author":"Gurfinkel A.","year":"2011","unstructured":"A. Gurfinkel , S. Chaki , and S. Sapra . Efficient Predicate Abstraction of Program Summaries . In Proc. of NFM'11 , volume 6617 of LNCS , pages 131 -- 145 , 2011 . A. Gurfinkel, S. Chaki, and S. Sapra. Efficient Predicate Abstraction of Program Summaries. In Proc. of NFM'11, volume 6617 of LNCS, pages 131--145, 2011."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706309"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503279"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964021"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806799.1806833"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103675"},{"key":"e_1_3_2_2_39_1","first-page":"348","volume-title":"Leino. Dafny: An Automatic Program Verifier for Functional Correctness. In Proc. of LPAR'10","author":"K. R.","year":"2010","unstructured":"K. R. M. Leino. Dafny: An Automatic Program Verifier for Functional Correctness. In Proc. of LPAR'10 , pages 348 -- 370 , 2010 . K. R. M. Leino. Dafny: An Automatic Program Verifier for Functional Correctness. In Proc. of LPAR'10, pages 348--370, 2010."},{"key":"e_1_3_2_2_40_1","unstructured":"A. Makhorin. The GNU Linear Programming Kit. http:\/\/www.gnu.org\/software\/glpk\/ 2000.  A. Makhorin. The GNU Linear Programming Kit. http:\/\/www.gnu.org\/software\/glpk\/ 2000."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/36205.36194"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-8609-1"},{"key":"e_1_3_2_2_43_1","volume-title":"Machine Learning","author":"Mitchell T. M.","year":"1997","unstructured":"T. M. Mitchell . Machine Learning . McGraw-Hill, Inc. , New York, NY, USA , 1997 . T. M. Mitchell. Machine Learning. McGraw-Hill, Inc., New York, NY, USA, 1997."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480899"},{"key":"e_1_3_2_2_45_1","volume-title":"Automatic Modular Abstractions for Template Numerical Constraints. Logical Methods in Computer Science, 6(3)","author":"Monniaux D.","year":"2010","unstructured":"D. Monniaux . Automatic Modular Abstractions for Template Numerical Constraints. Logical Methods in Computer Science, 6(3) , 2010 . D. Monniaux. Automatic Modular Abstractions for Template Numerical Constraints. Logical Methods in Computer Science, 6(3), 2010."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/11814948_18"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/1978665.1978669"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/2958031.2958054"},{"key":"e_1_3_2_2_49_1","first-page":"185","volume-title":"Advances in Kernel Methods","author":"Platt J. C.","year":"1999","unstructured":"J. C. Platt . Fast Training of Support Vector Machines Using Sequential Minimal Optimization . In Advances in Kernel Methods , pages 185 -- 208 . MIT Press , 1999 . J. C. Platt. Fast Training of Support Vector Machines Using Sequential Minimal Optimization. In Advances in Kernel Methods, pages 185--208. MIT Press, 1999."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/0098-1354(93)E0010-7"},{"key":"e_1_3_2_2_51_1","series-title":"LNCS","volume-title":"Proc. of VMCAI'04","author":"Reps T.","year":"2004","unstructured":"T. Reps , M. Sagiv , and G. Yorsh . Symbolic Implementation of the Best Transformer . In Proc. of VMCAI'04 , volume 2937 of LNCS , 2004 . T. Reps, M. Sagiv, and G. Yorsh. Symbolic Implementation of the Best Transformer. In Proc. of VMCAI'04, volume 2937 of LNCS, 2004."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375602"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.06.005"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_2"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2005.04.004"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31365-3_38"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008725524946"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168907"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_17"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33125-1_10"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.5555\/2041552.2041579"}],"event":{"name":"POPL '14: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"San Diego California USA","acronym":"POPL '14","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535838.2535857","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2535838.2535857","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:06Z","timestamp":1750219806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535838.2535857"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,8]]},"references-count":60,"alternative-id":["10.1145\/2535838.2535857","10.1145\/2535838"],"URL":"https:\/\/doi.org\/10.1145\/2535838.2535857","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2578855.2535857","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2014,1,8]]},"assertion":[{"value":"2014-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}