A general formal memory framework for smart contracts verification based on higher-order logic theorem proving

被引:0
|
作者
Yang Z. [1 ]
Lei H. [1 ]
机构
[1] School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu
关键词
Coq; Formal memory framework; Higher-order logic theorem proving; Programming language;
D O I
10.23940/ijpe.19.11.p19.29983007
中图分类号
学科分类号
摘要
Blockchain technology is one of the newest technologies in computer science and has been employed in many important fields. The correctness verification of smart contracts must be protected by the most reliable technology. One of the most reliable methods for s the security and reliability of smart contracts is a formal symbolic virtual machine based on higher-order logic proof system. Therefore, the present work proposes a formal specification framework of memory architecture as the basis for the symbolic execution and theorem proving combination. The framework is independent and customizable. It formalizes logic addresses, nonintrusive application programming interfaces, physical memory structures, and auxiliary tools in Coq. Simple case studies are employed to demonstrate its effectiveness. Finally, the proposed GERM framework is verified in Coq. © 2019 Totem Publisher, Inc. All rights reserved.
引用
收藏
页码:2998 / 3007
页数:9
相关论文
共 50 条
  • [21] Formal Analysis of Unmanned Aerial Vehicles Using Higher-Order-Logic Theorem Proving
    Abed, Sa'ed
    Rashid, Adnan
    Hasan, Osman
    JOURNAL OF AEROSPACE INFORMATION SYSTEMS, 2020, 17 (09): : 481 - 495
  • [22] THEOREM-PROVING FOR A HIGHER-ORDER FUNCTIONAL LANGUAGE
    KAUFMANN, M
    JOURNAL OF SYMBOLIC LOGIC, 1986, 51 (03) : 847 - 847
  • [23] Formal Probabilistic Analysis: A Higher-Order Logic Based Approach
    Hasan, Osman
    Tahar, Sofiene
    ABSTRACT STATE MACHINES, ALLOY, B AND Z, PROCEEDINGS, 2010, 5977 : 2 - 19
  • [24] Formal Verification of Fractional-Order PID Control Systems Using Higher-Order Logic
    Zhao, Chunna
    Jiang, Murong
    Huang, Yaqun
    FRACTAL AND FRACTIONAL, 2022, 6 (09)
  • [25] Formal Verification of Higher-Order Probabilistic Programs
    Sato, Tetsuya
    Aguirre, Alejandro
    Barthe, Gilles
    Gaboardi, Marco
    Garg, Deepak
    Hsu, Justin
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2019, 3 (POPL):
  • [26] Foundational, Compositional (Co)datatypes for Higher-Order Logic Category Theory Applied to Theorem Proving
    Traytel, Dmitriy
    Popescu, Andrei
    Blanchette, Jasmin Christian
    2012 27TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2012, : 596 - 605
  • [27] SPECIAL ISSUE ON HIGHER-ORDER LOGIC THEOREM-PROVING AND ITS APPLICATIONS .1.
    CLAESEN, L
    GORDON, M
    FORMAL METHODS IN SYSTEM DESIGN, 1993, 3 (1-2) : 5 - 5
  • [28] USE OF HIGHER-ORDER LOGIC IN PROGRAM VERIFICATION
    ERNST, GW
    HOOKWAY, RJ
    IEEE TRANSACTIONS ON COMPUTERS, 1976, 25 (08) : 844 - 851
  • [29] Formal Verification of C Systems CodeStructured Types, Separation Logic and Theorem Proving
    Harvey Tuch
    Journal of Automated Reasoning, 2009, 42 : 125 - 187
  • [30] Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems
    Chad E. Brown
    Journal of Automated Reasoning, 2013, 51 : 57 - 77