A Hybrid Formal Verification System in Coq for Ensuring the Reliability and Security of Ethereum-Based Service Smart Contracts
Open Access
- 27 January 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 21411-21436
Abstract
This paper reports a formal symbolic process virtual machine (FSPVM) denoted as FSPVM-E for verifying the reliability and security of Ethereum-based services at the source code level of smart contracts. A Coq proof assistant is employed for programming the system and for proving its correctness. The current version of FSPVM-E adopts execution-verification isomorphism, which is an application extension of Curry-Howard isomorphism, as its fundamental theoretical framework to combine symbolic execution and higher-order logic theorem proving. The four primary components of FSPVM-E include a general, extensible, and reusable formal memory framework, an extensible and universal formal intermediate programming language denoted as Lolisa, which is a large subset of the Solidity programming language using generalized algebraic datatypes, the corresponding formally verified interpreter of Lolisa, denoted as FEther, and assistant tools and libraries. The self-correctness of all components is certified in Coq. FSPVM-E supports the ERC20 token standard, and can automatically and symbolically execute Ethereum-based smart contracts, scan their standard vulnerabilities, and verify their reliability and security properties with Hoare-style logic in Coq.Keywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Introduction to the Coq Proof-Assistant for Practical Software Verification2012
- A Formal Model of Memory Peculiarities for the Verification of Low-Level Operating-System CodeElectronic Notes in Theoretical Computer Science, 2008
- Formal Verification of a C-like Memory Model and Its Uses for Verifying Program TransformationsJournal of Automated Reasoning, 2008
- An Operational Semantics for JavaScript2008
- Guarded recursive datatype constructorsACM SIGPLAN Notices, 2003
- Capability-Based Financial Instruments2001
- Symbolic Model Checking without BDDs1999
- Proving Java Type Soundness1999
- Monads for functional programming1995
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975