FEther: An Extensible Definitional Interpreter for Smart-contract Verifications in Coq

by   Zheng Yang, et al.

Blockchain technology adds records to a list using cryptographic links. Therefore, the security of blockchain smart contracts is among the most popular contemporary research topics. To improve the theorem-proving technology in this field, we are developing an extensible hybrid verification tool chain, denoted as FSPVM-E, for Ethereum smart contract verification. This hybrid system extends the proof assistants in Coq, a formal proof-management system. Combining symbolic execution with higher-order theorem-proving, it solves consistency, automation, and reusability problems by standard theorem-proving approaches. This article completes the FSPVM-E by developing its proof engine. FSPVM-E is an extensible definitional interpreter based on our previous work FEther, which is totally developed in the Coq proof assistant. It supports almost all semantics of the Solidity programing language, and simultaneously executes multiple types of symbols. FEther also contains a set of automatic strategies that execute and verify the smart contracts in Coq with a high level of automation. The functional correctness of FEther was verified in Coq. In standard tutorials, the execution efficiency of FEther far exceeded that of the interpreters developed in Coq.


page 6

page 19

page 20

page 21

page 23


Formal Process Virtual Machine for Smart Contracts Verification

This paper reports on the development and verification of a novel formal...

A Hybrid Formal Verification System in Coq for Ensuring the Reliability and Security of Ethereum-based Service Smart Contracts

This paper reports on the development of a formal symbolic process virtu...

On the Lazy Set object

The aim of this article is to employ the Lazy Set algorithm as an exampl...

Efficiency-Improved Inter-Rollup Transfer System Leveraging Batch Settlement Methods

As the significance of blockchain innovation grows and the focus on scal...

Verification of Bitcoin Script in Agda using Weakest Preconditions for Access Control

This paper contributes to the verification of programs written in Bitcoi...

Towards Smart Proof Search for Isabelle

Despite the recent progress in automatic theorem provers, proof engineer...

Optimization of Executable Formal Interpreters developed in Higher-order Theorem Proving Systems

In recent publications, we presented a novel formal symbolic process vir...

Please sign up or login with your details

Forgot password? Click here to reset