{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T04:35:04Z","timestamp":1771043704754,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,26]],"date-time":"2018-10-26T00:00:00Z","timestamp":1540512000000},"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":[[2018,10,26]]},"DOI":"10.1145\/3236024.3236084","type":"proceedings-article","created":{"date-parts":[[2018,10,29]],"date-time":"2018-10-29T12:06:00Z","timestamp":1540814760000},"page":"224-234","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Bug synthesis: challenging bug-finding tools with deep faults"],"prefix":"10.1145","author":[{"given":"Subhajit","family":"Roy","sequence":"first","affiliation":[{"name":"IIT Kanpur, India"}]},{"given":"Awanish","family":"Pandey","sequence":"additional","affiliation":[{"name":"IIT Kanpur, India"}]},{"given":"Brendan","family":"Dolan-Gavitt","sequence":"additional","affiliation":[{"name":"New York University, USA"}]},{"given":"Yu","family":"Hu","sequence":"additional","affiliation":[{"name":"New York University, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"American Fuzzy Lop (AFL) Fuzzer. http:\/\/lcamtuf.coredump.cx\/afl\/technical_ details.txt. (visited on 21th January 2018). American Fuzzy Lop (AFL) Fuzzer. http:\/\/lcamtuf.coredump.cx\/afl\/technical_ details.txt. (visited on 21th January 2018)."},{"key":"e_1_3_2_1_2_1","unstructured":"Clang: a C language family frontend for LLVM. http:\/\/clang.llvm.org\/. (visited on 21th September 2017). Clang: a C language family frontend for LLVM. http:\/\/clang.llvm.org\/. (visited on 21th September 2017)."},{"key":"e_1_3_2_1_3_1","unstructured":"Coreutils - GNU core utilities. https:\/\/www.gnu.org\/software\/coreutils\/coreutils. html. (visited on 15th September 2017). Coreutils - GNU core utilities. https:\/\/www.gnu.org\/software\/coreutils\/coreutils. html. (visited on 15th September 2017)."},{"key":"e_1_3_2_1_4_1","unstructured":"DARPA. Cyber Grand Challenge. http:\/\/archive.darpa.mil\/cybergrandchallenge\/. (visited on 9th March 2018). DARPA. Cyber Grand Challenge. http:\/\/archive.darpa.mil\/cybergrandchallenge\/. (visited on 9th March 2018)."},{"key":"e_1_3_2_1_5_1","unstructured":"NIST Software Assurance Reference Dataset Project. https:\/\/samate.nist.gov\/ SRD\/. (visited on 1st January 2018). Bug Synthesis ESEC\/FSE \u201918 November 4\u20139 2018 Lake Buena Vista FL USA NIST Software Assurance Reference Dataset Project. https:\/\/samate.nist.gov\/ SRD\/. (visited on 1st January 2018). Bug Synthesis ESEC\/FSE \u201918 November 4\u20139 2018 Lake Buena Vista FL USA"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984014"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2008.69"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201908)","author":"Cadar Cristian","year":"2008"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1080\/00031305.1992.10475878","article-title":"Explaining the Gibbs Sampler","volume":"46","author":"Casella George","year":"1992","journal-title":"The American Statistician"},{"key":"e_1_3_2_1_10_1","unstructured":"Alonzo Church. 1957. Application of Recursive Arithmetic to the Problem of Circuit Synthesis. Summaries of the Summer Institute of Symbolic Logic. Alonzo Church. 1957. Application of Recursive Arithmetic to the Problem of Circuit Synthesis. Summaries of the Summer Institute of Symbolic Logic."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/C-M.1978.218136"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-005-3861-2"},{"key":"e_1_3_2_1_14_1","volume-title":"LAVA: Large-Scale Automated Vulnerability Addition. In 2016 IEEE Symposium on Security and Privacy (SP). 110\u2013121","author":"Dolan-Gavitt B.","year":"2016"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180248"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Anshul Garg and Subhajit Roy. 2015. Synthesizing Heap Manipulations via Integer Linear Programming. In Static Analysis Sandrine Blazy and Thomas Jensen (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 109\u2013127. Anshul Garg and Subhajit Roy. 2015. Synthesizing Heap Manipulations via Integer Linear Programming. In Static Analysis Sandrine Blazy and Thomas Jensen (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 109\u2013127.","DOI":"10.1007\/978-3-662-48288-9_7"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2338965.2336773"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090147.2094081"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926423"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1977.231145"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2010.62"},{"key":"e_1_3_2_1_22_1","unstructured":"Richard Lipton. 1971. Fault Diagnosis of Computer Programs. (1971). Student report Carnegie Mellon Univ. Richard Lipton. 1971. Fault Diagnosis of Computer Programs. (1971). Student report Carnegie Mellon Univ."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786811"},{"key":"e_1_3_2_1_24_1","unstructured":"Kuldeep S Meel Moshe Y Vardi Supratik Chakraborty Daniel J Fremont Sanjit A Seshia Dror Fried Alexander Ivrii and Sharad Malik. 2016. Constrained Sampling and Counting: Universal Hashing Meets SAT Solving. Kuldeep S Meel Moshe Y Vardi Supratik Chakraborty Daniel J Fremont Sanjit A Seshia Dror Fried Alexander Ivrii and Sharad Malik. 2016. Constrained Sampling and Counting: Universal Hashing Meets SAT Solving."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2486788.2486890"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Aina Niemetz Mathias Preiner and Armin Biere. 2014 (published 2015). Boolector 2.0 system description. Journal on Satisfiability Boolean Modeling and Computation 9 (2014 (published 2015)) 53\u201358. Aina Niemetz Mathias Preiner and Armin Biere. 2014 (published 2015). Boolector 2.0 system description. Journal on Satisfiability Boolean Modeling and Computation 9 (2014 (published 2015)) 53\u201358.","DOI":"10.3233\/SAT190101"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2991079.2991103"},{"key":"e_1_3_2_1_28_1","unstructured":"2991103 2991103"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Subhajit Roy. 2013. From Concrete Examples to Heap Manipulating Programs. In Static Analysis Francesco Logozzo and Manuel F\u00e4hndrich (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 126\u2013149. Subhajit Roy. 2013. From Concrete Examples to Heap Manipulating Programs. In Static Analysis Francesco Logozzo and Manuel F\u00e4hndrich (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 126\u2013149.","DOI":"10.1007\/978-3-642-38856-9_9"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134105"},{"key":"e_1_3_2_1_31_1","unstructured":"Armando Solar-Lezama. 2008. Program Synthesis by Sketching. Ph.D. Dissertation. University of California Berkeley. Armando Solar-Lezama. 2008. Program Synthesis by Sketching. Ph.D. Dissertation. University of California Berkeley."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2016.23368"},{"key":"e_1_3_2_1_33_1","unstructured":"L\u00e1szl\u00f3 Szekeres. 2017. Memory corruption mitigation via hardening and testing. Ph.D. Dissertation. Stony Brook University. L\u00e1szl\u00f3 Szekeres. 2017. Memory corruption mitigation via hardening and testing. Ph.D. Dissertation. Stony Brook University."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/11814948_38"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3106237.3106263"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/11499107_24"},{"key":"e_1_3_2_1_38_1","volume-title":"Proceedings of the 7th Nordic Workshop on Secure IT Systems.","author":"Wilander John","year":"2002"}],"event":{"name":"ESEC\/FSE '18: 26th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering","location":"Lake Buena Vista FL USA","acronym":"ESEC\/FSE '18","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"]},"container-title":["Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3236024.3236084","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3236024.3236084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:26Z","timestamp":1750208246000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3236024.3236084"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,26]]},"references-count":38,"alternative-id":["10.1145\/3236024.3236084","10.1145\/3236024"],"URL":"https:\/\/doi.org\/10.1145\/3236024.3236084","relation":{},"subject":[],"published":{"date-parts":[[2018,10,26]]},"assertion":[{"value":"2018-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}