{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:59:52Z","timestamp":1759147192013,"version":"3.37.3"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1109\/access.2017.2697918","type":"journal-article","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T21:35:53Z","timestamp":1494624953000},"page":"7816-7825","source":"Crossref","is-referenced-by-count":15,"title":["Verification of Implementations of Cryptographic Hash Functions"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6285-9123","authenticated-orcid":false,"given":"Dexi","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2631-9223","authenticated-orcid":false,"given":"Houbing","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaguang","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Model checking","year":"1999","author":"clarke","key":"ref10"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/3-540-65306-6_21","article-title":"The state explosion problem","author":"valmari","year":"1998","journal-title":"Lectures on Petri Nets I Basic Models"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0065-2458(03)58003-2","article-title":"Bounded model checking","volume":"58","author":"biere","year":"2003","journal-title":"Adv Comput"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/876638.876643"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/381694.378846"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1321"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_6"},{"key":"ref18","first-page":"104","article-title":"Fast collision attack on MD5","volume":"53","author":"stevens","year":"2006","journal-title":"IACR Cryptology ePrint"},{"key":"ref19","first-page":"17","article-title":"Finding collisions in the full SHA-1","author":"wang","year":"2005","journal-title":"Proc Annu Int Cryptol Conf"},{"key":"ref28","first-page":"887","article-title":"Reliable and reproducible competition results with benchexec and witnesses (report on sv-comp 2016)","author":"beyer","year":"2016","journal-title":"Proc TACAS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2346171"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82453-1_5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2014.2316234"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2012.2225393"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2016.2573762"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.124"},{"key":"ref7","first-page":"112","article-title":"Use runtime verification to improve the quality of medical care practice","author":"jiang","year":"2016","journal-title":"Proc 38th Int Conf Softw Eng Companion"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2001.989832"},{"key":"ref9","first-page":"322","article-title":"An automata-theoretic approach to automatic program verification","author":"vardi","year":"1986","journal-title":"Proc Symp Logic in Computer Science (LICS)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660370"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_58"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/543552.512538","article-title":"ESP: Path-sensitive program verification in polynomial time","volume":"37","author":"das","year":"2002","journal-title":"ACM SIGPLAN Notices"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1707801.1706337"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36577-X_24"},{"key":"ref23","first-page":"1","article-title":"Hash function of finalist SHA-3: Analysis study","volume":"2","author":"shaikhli","year":"2014","journal-title":"Int J Adv Comput Inf Technol"},{"key":"ref26","first-page":"108","article-title":"Extending the theory of arrays: Memset, memcpy, and beyond","author":"falke","year":"2013","journal-title":"Proc Fifth Working Conf Verified Software Theories Tools Experiments"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-94-011-1793-7_2","article-title":"Towards a mathematical science of computation","author":"mccarthy","year":"1993","journal-title":"Program Verification"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/7859429\/07924403.pdf?arnumber=7924403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:29:58Z","timestamp":1642004998000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7924403\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/access.2017.2697918","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2017]]}}}