{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:17Z","timestamp":1763468057991,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,17]],"date-time":"2011-10-17T00:00:00Z","timestamp":1318809600000},"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":[[2011,10,17]]},"DOI":"10.1145\/2046707.2046745","type":"proceedings-article","created":{"date-parts":[[2011,10,18]],"date-time":"2011-10-18T13:02:00Z","timestamp":1318942920000},"page":"331-340","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Extracting and verifying cryptographic models from C protocol code by symbolic execution"],"prefix":"10.1145","author":[{"given":"Mihhail","family":"Aizatulin","sequence":"first","affiliation":[{"name":"The Open University, Milton Keynes, United Kingdom"}]},{"given":"Andrew D.","family":"Gordon","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}]},{"given":"Jan","family":"J\u00fcrjens","sequence":"additional","affiliation":[{"name":"TU Dortmund & Fraunhofer ISST, Dortmund, Germany"}]}],"member":"320","published-online":{"date-parts":[[2011,10,17]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/360204.360213"},{"key":"e_1_3_2_1_2_1","volume-title":"Extracting and verifying cryptographic models from C protocol code by symbolic execution (long version).","author":"Aizatulin M.","year":"2011","unstructured":"M. Aizatulin , A. D. Gordon , and J. J\u00fcrjens . Extracting and verifying cryptographic models from C protocol code by symbolic execution (long version). Available at http:\/\/arxiv.org\/abs\/1107.1017, 2011 . M. Aizatulin, A. D. Gordon, and J. J\u00fcrjens. Extracting and verifying cryptographic models from C protocol code by symbolic execution (long version). Available at http:\/\/arxiv.org\/abs\/1107.1017, 2011."},{"key":"e_1_3_2_1_3_1","volume-title":"NASA Formal Methods Symposium 2009","author":"Almeida J. B.","year":"2009","unstructured":"J. B. Almeida , M. Barbosa , J. S. Pinto , and B. Vieira . Deductive verification of cryptographic software . In NASA Formal Methods Symposium 2009 , 2009 . J. B. Almeida, M. Barbosa, J. S. Pinto, and B. Vieira. Deductive verification of cryptographic software. In NASA Formal Methods Symposium 2009, 2009."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1007\/11513988_27"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/1653662.1653672"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1109\/CSF.2008.27"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/SP.2006.1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.5555\/1576303.1576304"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1016\/j.jlap.2007.06.002"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1137\/0213053"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1109\/ASE.2008.69"},{"key":"e_1_3_2_1_12_1","volume-title":"USENIX Symposium on Operating Systems Design and Implementation (OSDI 2008","author":"Cadar C.","year":"2008","unstructured":"C. Cadar , D. Dunbar , and D. Engler . KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs . In USENIX Symposium on Operating Systems Design and Implementation (OSDI 2008 ), San Diego, CA , Dec. 2008 . C. Cadar, D. Dunbar, and D. Engler. KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs. In USENIX Symposium on Operating Systems Design and Implementation (OSDI 2008), San Diego, CA, Dec. 2008."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/CSF.2009.20"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.5555\/1946341.1946348"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/512950.512973"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1109\/TIT.1983.1056650"},{"key":"e_1_3_2_1_17_1","volume-title":"The Yices SMT Solver. Technical report","author":"Dutertre B.","year":"2006","unstructured":"B. Dutertre and L. D. Moura . The Yices SMT Solver. Technical report , 2006 . B. Dutertre and L. D. Moura. The Yices SMT Solver. Technical report, 2006."},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the Network and Distributed System Security Symposium, NDSS 2008","author":"Godefroid P.","year":"2008","unstructured":"P. Godefroid , M. Y. Levin , and D. A. Molnar . Automated whitebox fuzz testing . In Proceedings of the Network and Distributed System Security Symposium, NDSS 2008 . The Internet Society , 2008 . P. Godefroid, M. Y. Levin, and D. A. Molnar. Automated whitebox fuzz testing. In Proceedings of the Network and Distributed System Security Symposium, NDSS 2008. The Internet Society, 2008."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1016\/0022-0000(84)90070-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1007\/978-3-540-30579-8_24"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/360248.360252"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1109\/CSF.2009.17"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1007\/s10817-010-9188-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1016\/0020-0190(95)00144-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.5555\/647478.727796"},{"key":"e_1_3_2_1_26_1","volume-title":"Security protocols open repository","author":"EVA.","year":"2007","unstructured":"Project EVA. Security protocols open repository , 2007 . http:\/\/www.lsv.ens-cachan.fr\/spore\/. Project EVA. Security protocols open repository, 2007. http:\/\/www.lsv.ens-cachan.fr\/spore\/."},{"key":"e_1_3_2_1_29_1","volume-title":"July","author":"Unruh D.","year":"2010","unstructured":"D. Unruh . The impossibility of computationally sound XOR , July 2010 . Preprint on IACR ePrint 2010\/389. D. Unruh. The impossibility of computationally sound XOR, July 2010. Preprint on IACR ePrint 2010\/389."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1109\/SFCS.1982.95"}],"event":{"sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"acronym":"CCS'11","name":"CCS'11: the ACM Conference on Computer and Communications Security","location":"Chicago Illinois USA"},"container-title":["Proceedings of the 18th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2046707.2046745","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2046707.2046745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:42Z","timestamp":1750240122000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2046707.2046745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,17]]},"references-count":28,"alternative-id":["10.1145\/2046707.2046745","10.1145\/2046707"],"URL":"https:\/\/doi.org\/10.1145\/2046707.2046745","relation":{},"subject":[],"published":{"date-parts":[[2011,10,17]]},"assertion":[{"value":"2011-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}