{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:17:55Z","timestamp":1740169075851,"version":"3.37.3"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1109\/access.2018.2880692","type":"journal-article","created":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T23:25:47Z","timestamp":1542065147000},"page":"70331-70348","source":"Crossref","is-referenced-by-count":5,"title":["Optimization of Executable Formal Interpreters Developed in Higher-Order Logic Theorem Proving Systems"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0165-0000","authenticated-orcid":false,"given":"Zheng","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hang","family":"Lei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Structure and Interpretation of Computer Programs","year":"1996","author":"abelson","key":"ref30"},{"journal-title":"Lolisa Formal Syntax and Semantics for a Subset of the Solidity Programming Language","year":"2018","author":"yang","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-009-9148-3"},{"key":"ref12","first-page":"209","article-title":"KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs","author":"cadar","year":"2008","journal-title":"Proc OSDI"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_27"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2018.00022"},{"key":"ref15","first-page":"520","article-title":"Defining the ethereum virtual machine for interactive theorem provers","author":"hirai","year":"2017","journal-title":"Proc FC"},{"key":"ref16","first-page":"233","article-title":"Frama-c","author":"cuoq","year":"2012","journal-title":"Proc SEFM"},{"key":"ref17","first-page":"1","article-title":"Verified software toolchain","author":"appel","year":"2011","journal-title":"Proc ESOP"},{"journal-title":"The CompCert C Verified Compiler Documentation and User’s Manual","year":"2018","key":"ref18"},{"key":"ref19","first-page":"126","article-title":"SMTCoq: A plug-in for integrating SMT solvers into Coq","author":"ekici","year":"2017","journal-title":"Proc CAV"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.21236\/ADA360973"},{"journal-title":"Ethereum solidity documentation","year":"2017","key":"ref4"},{"key":"ref27","first-page":"1","article-title":"Some history of functional programming languages","author":"turner","year":"2012","journal-title":"Proc TFP"},{"journal-title":"Storj A Peer-to-Peer Cloud Storage Network","year":"2016","author":"wilkinson","key":"ref3"},{"journal-title":"Ethereum Parity Hack May Impact ETH 500 000 or $146 Million","year":"2017","key":"ref6"},{"journal-title":"Ethereum Gas Documentation","year":"2017","key":"ref29"},{"journal-title":"The DAO Attacked Code Issue Leads to $60 Million Ether Theft","year":"2016","key":"ref5"},{"journal-title":"A General Formal Memory Framework in Coq for Verifying the Properties of Programs Based on Higher-Order Logic Theorem Proving With Increased","year":"2018","author":"yang","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978309"},{"journal-title":"Bitcoin and Cryptocurrency Technologies A Comprehensive Introduction","year":"2016","author":"narayanan","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.23940\/ijpe.18.08.p9.17261734"},{"journal-title":"Bitcoin A Peer-to-Peer Electronic Cash System","year":"2008","author":"nakamoto","key":"ref1"},{"key":"ref20","first-page":"1","article-title":"Christopher strachey—Understanding programming languages","volume":"13 nos","author":"burstall","year":"2000","journal-title":"Higher-Order Symbolic Comput"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90044-5"},{"journal-title":"The Lambda Calculus Its Syntax and Semantics","year":"1984","author":"henk","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139567725","author":"nederpelt","year":"2014","journal-title":"Type Theory and Formal Proof An Introduction"},{"journal-title":"Certified Programming with Dependent Types A Pragmatic Introduction to the Coq Proof Assistant","year":"2013","author":"chlipala","key":"ref26"},{"journal-title":"The Coq Proof Assistant Reference Manual","year":"2018","key":"ref25"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08531607.pdf?arnumber=8531607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T18:34:46Z","timestamp":1643222086000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8531607\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2880692","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}