{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:31:17Z","timestamp":1760596277982,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,9,18]],"date-time":"2016-09-18T00:00:00Z","timestamp":1474156800000},"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":[[2016,9,18]]},"DOI":"10.1145\/2993717.2993724","type":"proceedings-article","created":{"date-parts":[[2016,10,21]],"date-time":"2016-10-21T14:16:42Z","timestamp":1477059402000},"page":"81-90","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Carraybound"],"prefix":"10.1145","author":[{"given":"Fengjuan","family":"Gao","sequence":"first","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianjiao","family":"Chen","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Wang","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingyun","family":"Situ","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linzhang","family":"Wang","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuandong","family":"Li","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,9,18]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Z3 theorem prover. https:\/\/z3.codeplex.com\/.  Z3 theorem prover. https:\/\/z3.codeplex.com\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102120.1102165"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/390013.808479"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/773473.178446"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/358438.349342"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455518.1455522"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2134254.2134262"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095809.1095824"},{"key":"e_1_3_2_1_9_1","first-page":"63","volume":"98","author":"Cowan C.","year":"1998","journal-title":"In Usenix Security"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102120.1102152"},{"key":"e_1_3_2_1_11_1","unstructured":"D. L. Detlefs K. R. M. Leino G. Nelson and J. B. Saxe. Extended static checking. 1998.  D. L. Detlefs K. R. M. Leino G. Nelson and J. B. Saxe. Extended static checking. 1998."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134285.1134309"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379022.1375607"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064978.1065036"},{"key":"e_1_3_2_1_15_1","first-page":"151","volume-title":"NDSS","volume":"8","author":"Godefroid P.","year":"2008"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"J. L. Gross and J. Yellen. Handbook of graph theory. CRC press 2004.  J. L. Gross and J. Yellen. Handbook of graph theory . CRC press 2004.","DOI":"10.1201\/9780203490204"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029873.1029883"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1592955"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/512927.512945"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/380171.380185"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/645369.651280"},{"volume-title":"DTIC Document","year":"2012","author":"McNally R.","key":"e_1_3_2_1_22_1"},{"key":"e_1_3_2_1_23_1","first-page":"65","volume-title":"24th USENIX Security Symposium (USENIX Security 15)","author":"Ming J.","year":"2015"},{"key":"e_1_3_2_1_24_1","unstructured":"J. Newsome and D. Song. Dynamic taint analysis for automatic detection analysis and signature generation of exploits on commodity software. 2005.  J. Newsome and D. Song. Dynamic taint analysis for automatic detection analysis and signature generation of exploits on commodity software. 2005."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234183"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380220403"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1037187.1024404"},{"key":"e_1_3_2_1_28_1","unstructured":"M. Sutton A. Greene and P. Amini. Brute force vulnerability discovery 2007.   M. Sutton A. Greene and P. Amini. Brute force vulnerability discovery 2007."},{"volume-title":"John Wiley & Sons","year":"2011","author":"Thulasiraman K.","key":"e_1_3_2_1_29_1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2011.5958225"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSAC.2008.37"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390630.1390636"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/358438.349313"},{"first-page":"91","volume-title":"ICST'16","author":"Ye T.","key":"e_1_3_2_1_34_1"}],"event":{"name":"Internetware '16: The Eighth Asia-Pacific Symposium on Internetware","acronym":"Internetware '16","location":"Beijing China"},"container-title":["Proceedings of the 8th Asia-Pacific Symposium on Internetware"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2993717.2993724","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2993717.2993724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:50:23Z","timestamp":1750218623000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2993717.2993724"}},"subtitle":["static array bounds checking in C programs based on taint analysis"],"short-title":[],"issued":{"date-parts":[[2016,9,18]]},"references-count":34,"alternative-id":["10.1145\/2993717.2993724","10.1145\/2993717"],"URL":"https:\/\/doi.org\/10.1145\/2993717.2993724","relation":{},"subject":[],"published":{"date-parts":[[2016,9,18]]},"assertion":[{"value":"2016-09-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}