基于证明助手的Core Erlang形式化
A Proof Assistant Based Formalisation of Core Erlang
摘要:
我们的研究是一个更广泛的项目的一部分,该项目旨在调查和推理Erlang程序基于模式的源代码转换的正确性。为了形式化地推理程序设计语言的定义和使用它构建的软件,我们需要对该语言进行严格的数学描述。在本文中,我们提出了我们的证明辅助为基础的形式化的一个子集的Erlang,旨在作为一个基地,证明重构正确。在讨论了我们如何重用相关工作中的概念之后,我们展示了我们的形式化描述的语法和语义,包括所涉及的抽象(例如闭包)。我们还提出了形式化的基本属性(例如确定性)以及它们的机器检查证明。最后,我们证明了一些简单的重构策略的正确性。
英文摘要:
Our research is part of a wider project that aims to investigate and reason about the correctness of scheme-based source code transformations of Erlang programs. In order to formally reason about the definition of a programming language and the software built using it, we need a mathematically rigorous description of that language. In this paper, we present our proof-assistant-based formalisation of a subset of Erlang, intended to serve as a base for proving refactorings correct. After discussing how we reused concepts from related work, we show the syntax and semantics of our formal description, including the abstractions involved (e.g. closures). We also present essential properties of the formalisation (e.g. determinism) along with their machine-checked proofs. Finally, we prove the correctness of some simple refactoring strategies.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。