当前位置: X-MOL 学术arXiv.cs.SC › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The Imandra Automated Reasoning System (system description)
arXiv - CS - Symbolic Computation Pub Date : 2020-04-21 , DOI: arxiv-2004.10263
Grant Olney Passmore, Simon Cruanes, Denis Ignatovich, Dave Aitken, Matt Bray, Elijah Kagan, Kostya Kanishev, Ewen Maclean, and Nicola Mometto

We describe Imandra, a modern computational logic theorem prover designed to bridge the gap between decision procedures such as SMT, semi-automatic inductive provers of the Boyer-Moore family like ACL2, and interactive proof assistants for typed higher-order logics. Imandra's logic is computational, based on a pure subset of OCaml in which all functions are terminating, with restrictions on types and higher-order functions that allow conjectures to be translated into multi-sorted first-order logic with theories, including arithmetic and datatypes. Imandra has novel features supporting large-scale industrial applications, including a seamless integration of bounded and unbounded verification, first-class computable counterexamples, efficiently executable models and a cloud-native architecture supporting live multiuser collaboration. The core reasoning mechanisms of Imandra are (i) a semi-complete procedure for finding models of formulas in the logic mentioned above, centered around the lazy expansion of recursive functions, and (ii) an inductive waterfall and simplifier which "lifts" many Boyer-Moore ideas to our typed higher-order setting. These mechanisms are tightly integrated and subject to many forms of user control. Imandra's user interfaces include an interactive toplevel, Jupyter notebooks and asynchronous document-based verification (in the spirit of Isabelle's Prover IDE) with VS Code.

中文翻译:

Imandra 自动推理系统(系统描述)

我们描述了 Imandra,这是一种现代计算逻辑定理证明器,旨在弥合决策程序(如 SMT)、博耶-摩尔家族的半自动归纳证明器(如 ACL2)和用于输入高阶逻辑的交互式证明助手之间的差距。Imandra 的逻辑是计算性的,基于 OCaml 的一个纯子集,其中所有函数都终止,对类型和高阶函数有限制,允许将猜想转换为具有理论的多排序一阶逻辑,包括算术和数据类型。Imandra 具有支持大规模工业应用的新颖功能,包括有界和无界验证的无缝集成、一流的可计算反例、高效可执行的模型和支持实时多用户协作的云原生架构。Imandra 的核心推理机制是 (i) 一个在上述逻辑中寻找公式模型的半完整程序,以递归函数的惰性展开为中心,以及 (ii) 一个归纳瀑布和简化器,它“提升”了许多 Boyer - 对我们键入的高阶设置的摩尔想法。这些机制紧密集成并受多种形式的用户控制。Imandra 的用户界面包括交互式顶层、Jupyter 笔记本和使用 VS Code 的异步基于文档的验证(本着 Isabelle 的 Prover IDE 的精神)。许多 Boyer-Moore 想法都适用于我们键入的高阶设置。这些机制紧密集成并受多种形式的用户控制。Imandra 的用户界面包括交互式顶层、Jupyter 笔记本和使用 VS Code 的异步基于文档的验证(本着 Isabelle 的 Prover IDE 的精神)。许多 Boyer-Moore 想法都适用于我们键入的高阶设置。这些机制紧密集成并受多种形式的用户控制。Imandra 的用户界面包括交互式顶层、Jupyter 笔记本和使用 VS Code 的异步基于文档的验证(本着 Isabelle 的 Prover IDE 的精神)。
更新日期:2020-04-23
down
wechat
bug