The Imandra Automated Reasoning System (System Description)

• Published in: Automated Reasoning Vol. 12167; pp. 464 - 471
• Main Authors: Passmore, Grant, Cruanes, Simon, Ignatovich, Denis, Aitken, Dave, Bray, Matt, Kagan, Elijah, Kanishev, Kostya, Maclean, Ewen, Mometto, Nicola
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 01.01.2020; Springer International Publishing
• Series: Lecture Notes in Computer Science
• ISBN: 9783030510534; 3030510530
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-030-51054-1_30

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, (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.