arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1911.08033cs.PL
收藏

一种用于形式化验证区块链共识协议的进程演算

A Process Calculus for Formally Verifying Blockchain Consensus Protocols

Wolfgang Jeltsch

摘要:

区块链在金融、物流和房地产等各个领域的相关性越来越强。区块链系统的基本任务是在开放网络中的分布式代理之间建立数据一致性。区块链共识协议是执行这项任务的核心。由于共识协议在区块链技术中发挥着至关重要的作用,因此有几个项目正在进行中,这些项目将正式方法应用于这些协议。其中一个这样的项目是由IOHK的正式方法组的一个小组进行的。作者参与的这个项目旨在正式验证Ouroboros家族共识协议的实现,这是Cardano区块链的支柱。我们项目的第一个成果是$\natural$ -演算(发音为“自然演算”),一种通用的过程演算,作为我们的实现语言。$\natural$演算是一种使用高阶抽象语法嵌入在函数宿主语言中的领域特定语言。本文将是对$\natural$ -演算的一次漫谈。首先,我们将研究它的语言及其操作语义。后者的独特之处在于,它使用两个标记的转换系统的堆栈来处理数据传输和以模块化方式打开和关闭通道作用域等现象。多个转换系统的存在要求对派生的并发概念进行通用处理。我们将看到如何通过使用基于函子和单子的公理化定义的代数结构抽象地捕获作用域开放和无声转换等概念来实现这样的处理。

英文摘要:

Blockchains are becoming increasingly relevant in a variety of fields, such as finance, logistics, and real estate. The fundamental task of a blockchain system is to establish data consistency among distributed agents in an open network. Blockchain consensus protocols are central for performing this task. Since consensus protocols play such a crucial role in blockchain technology, several projects are underway that apply formal methods to these protocols. One such project is carried out by a team of the Formal Methods Group at IOHK. This project, in which the author is involved, aims at a formally verified implementation of the Ouroboros family of consensus protocols, the backbone of the Cardano blockchain. The first outcome of our project is the $\natural$-calculus (pronounced "natural calculus"), a general-purpose process calculus that serves as our implementation language. The $\natural$-calculus is a domain-specific language embedded in a functional host language using higher-order abstract syntax. This paper will be a ramble through the $\natural$-calculus. First we will look at its language and its operational semantics. The latter is unique in that it uses a stack of two labeled transition systems to treat phenomena like data transfer and the opening and closing of channel scope in a modular fashion. The presence of multiple transition systems calls for a generic treatment of derived concurrency concepts. We will see how such a treatment can be achieved by capturing notions like scope opening and silent transitions abstractly using axiomatically defined algebraic structures based on functors and monads.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑