Formal Analysis of Smart Contracts: Applying the KeY System
Book chapter, 2020

Smart contracts are programs running on decentralized, distributed ledger platforms. Rigorous formal analysis of these programs is highly desirable because they manage valuable assets and therefore are a prime target for security attacks. In this paper, we show that the computation model of smart contracts allows the application of formal methods designed for analysing single-threaded imperative programs. We discuss different classes of correctness properties and the formal methods that may be applied. Furthermore, we show how deductive program verification in particular can be used to prove correctness of smart contracts, and we discuss two approaches where we have applied the program verification tool KeY.

Author

Jonas Schiffl

Karlsruhe Institute of Technology (KIT)

Wolfgang Ahrendt

Chalmers, Computer Science and Engineering (Chalmers), Formal methods

B. Beckert

Karlsruhe Institute of Technology (KIT)

Richard Bubel

Technische Universität Darmstadt

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

204-218

Subject Categories

Embedded Systems

Computer Science

Computer Systems

DOI

10.1007/978-3-030-64354-6_8

More information

Latest update

3/21/2023