{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:50Z","timestamp":1750220750709,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T00:00:00Z","timestamp":1593216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Facebook Testing and Verification Research Award"},{"name":"NSF","award":["CCF-1703637, CCF-1704790, CCF-1846354"],"award-info":[{"award-number":["CCF-1703637, CCF-1704790, CCF-1846354"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6,27]]},"DOI":"10.1145\/3377816.3381740","type":"proceedings-article","created":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T01:49:05Z","timestamp":1600480145000},"page":"109-112","source":"Crossref","is-referenced-by-count":1,"title":["Predictive constraint solving and analysis"],"prefix":"10.1145","author":[{"given":"Alyas","family":"Almaawi","sequence":"first","affiliation":[{"name":"University of Texas at Austin"}]},{"given":"Nima","family":"Dini","sequence":"additional","affiliation":[{"name":"University of Texas at Austin"}]},{"given":"Cagdas","family":"Yelen","sequence":"additional","affiliation":[{"name":"University of Texas at Austin"}]},{"given":"Milos","family":"Gligoric","sequence":"additional","affiliation":[{"name":"University of Texas at Austin"}]},{"given":"Sasa","family":"Misailovic","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}]},{"given":"Sarfraz","family":"Khurshid","sequence":"additional","affiliation":[{"name":"University of Texas at Austin"}]}],"member":"320","published-online":{"date-parts":[[2020,9,18]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2019. International SAT Competitions Webpage. http:\/\/www.satcompetition.org\/.  2019. International SAT Competitions Webpage. http:\/\/www.satcompetition.org\/."},{"key":"e_1_3_2_1_2_1","unstructured":"2019. Korat GitHub Repository. https:\/\/github.com\/korattest\/korat.  2019. Korat GitHub Repository. https:\/\/github.com\/korattest\/korat."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Abdulbaki Aydin Lucas Bang and Tevfik Bultan. 2015. Automata-Based Model Counting for String Constraints. In CAV. 255--272.  Abdulbaki Aydin Lucas Bang and Tevfik Bultan. 2015. Automata-Based Model Counting for String Constraints. In CAV. 255--272.","DOI":"10.1007\/978-3-319-21690-4_15"},{"key":"e_1_3_2_1_4_1","unstructured":"Paul Beame Russell Impagliazzo Toniann Pitassi and Nathan Segerlind. 2003. Memoization and DPLL: Formula Caching Proof Systems. In Complexity.  Paul Beame Russell Impagliazzo Toniann Pitassi and Nathan Segerlind. 2003. Memoization and DPLL: Formula Caching Proof Systems. In Complexity."},{"key":"e_1_3_2_1_5_1","unstructured":"A. Biere M. Heule H. van Maaren and T. Walsh (Eds.). 2009. Handbook of Satisfiability. Vol. 185.  A. Biere M. Heule H. van Maaren and T. Walsh (Eds.). 2009. Handbook of Satisfiability. Vol. 185."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/566172.566191"},{"volume-title":"KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. In OSDI.","year":"2008","author":"Cadar C.","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","first-page":"1","article-title":"2017. Stan","volume":"76","author":"Bob Carpenter","year":"2017","journal-title":"A Probabilistic Programming Language. JSS"},{"volume-title":"Vardi","year":"2013","author":"Chakraborty Supratik","key":"e_1_3_2_1_9_1"},{"key":"e_1_3_2_1_10_1","unstructured":"E. M. Clarke Jr. O. Grumberg and D. A. Peled. 1999. Model Checking. MIT Press.  E. M. Clarke Jr. O. Grumberg and D. A. Peled. 1999. Model Checking. MIT Press."},{"key":"e_1_3_2_1_11_1","unstructured":"T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2009. Introduction to Algorithms. The MIT Press.  T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2009. Introduction to Algorithms. The MIT Press."},{"volume-title":"MKorat: A novel approach for memorizing the Korat search and some potential applications. Master's thesis","author":"Dini Nima","key":"e_1_3_2_1_12_1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Antonio Filieri Marcelo F. Frias Corina S. Pasareanu and Willem Visser. 2015. Model Counting for Complex Data Structures. In SPIN. 222--241.  Antonio Filieri Marcelo F. Frias Corina S. Pasareanu and Willem Visser. 2015. Model Counting for Complex Data Structures. In SPIN. 222--241.","DOI":"10.1007\/978-3-319-23404-5_15"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Antonio Filieri Corina S. P\u0103s\u0103reanu and Willem Visser. 2013. Reliability Analysis in Symbolic Pathfinder. In ICSE. 622--631.  Antonio Filieri Corina S. P\u0103s\u0103reanu and Willem Visser. 2013. Reliability Analysis in Symbolic Pathfinder. In ICSE. 622--631.","DOI":"10.1109\/ICSE.2013.6606608"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065036"},{"volume-title":"Model Counting: A New Strategy for Obtaining Good Bounds. In AAAI. 54--61.","year":"2006","author":"Gomes Carla P.","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Seonmo Kim and Stephen McCamant. 2018. Bit-Vector Model Counting Using Statistical Estimation. In TACAS. 133--151.  Seonmo Kim and Stephen McCamant. 2018. Bit-Vector Model Counting Using Statistical Estimation. In TACAS. 133--151.","DOI":"10.1007\/978-3-319-89960-2_8"},{"volume-title":"Symbolic Execution and Program Testing. CACM 19, 7","year":"1976","author":"King J. C.","key":"e_1_3_2_1_18_1"},{"volume-title":"Machine Learning (1 ed.)","author":"Mitchell Thomas M.","key":"e_1_3_2_1_19_1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","DOI":"10.1145\/3105906","volume-title":"Automatic Software Repair: A Bibliography. CUSR 51, 1","author":"Monperrus M.","year":"2018"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"N. Rosner C. Pombo N. Aguirre A. Jaoua A. Mili and M. F. Frias. 2013. Parallel Bounded Verification of Alloy Models by TranScoping. In VSTTE. 88--107.  N. Rosner C. Pombo N. Aguirre A. Jaoua A. Mili and M. F. Frias. 2013. Parallel Bounded Verification of Alloy Models by TranScoping. In VSTTE. 88--107.","DOI":"10.1007\/978-3-642-54108-7_5"},{"volume-title":"Marques Silva and Karem A. Sakallah","year":"1996","author":"Jo\u00e3o","key":"e_1_3_2_1_22_1"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Mate Soos Karsten Nohl and Claude Castelluccia. 2009. Extending SAT Solvers to Cryptographic Problems. In TACAS. 244--257.  Mate Soos Karsten Nohl and Claude Castelluccia. 2009. Extending SAT Solvers to Cryptographic Problems. In TACAS. 244--257.","DOI":"10.1007\/978-3-642-02777-2_24"},{"key":"e_1_3_2_1_24_1","first-page":"1","article-title":"2012. Green: Reducing","volume":"58","author":"Visser Willem","journal-title":"Reusing and Recycling Constraints in Program Analysis. In FSE."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Guowei Yang Corina S. Pasareanu and Sarfraz Khurshid. 2012. Memoized symbolic execution. In ISSTA. 144--154.  Guowei Yang Corina S. Pasareanu and Sarfraz Khurshid. 2012. Memoized symbolic execution. In ISSTA. 144--154.","DOI":"10.1145\/2338965.2336771"},{"key":"e_1_3_2_1_26_1","first-page":"2","article-title":"2012. Regression Testing Minimization","volume":"22","author":"Yoo S.","year":"2012","journal-title":"Selection and Prioritization: A Survey. STVR"}],"event":{"name":"ICSE '20: 42nd International Conference on Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","KIISE Korean Institute of Information Scientists and Engineers","IEEE CS"],"location":"Seoul South Korea","acronym":"ICSE '20"},"container-title":["Proceedings of the ACM\/IEEE 42nd International Conference on Software Engineering: New Ideas and Emerging Results"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377816.3381740","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377816.3381740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:52Z","timestamp":1750199932000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377816.3381740"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,27]]},"references-count":26,"alternative-id":["10.1145\/3377816.3381740","10.1145\/3377816"],"URL":"https:\/\/doi.org\/10.1145\/3377816.3381740","relation":{},"subject":[],"published":{"date-parts":[[2020,6,27]]}}}