Ensuring fairness in machine learning (ML) is vital, especially as these models are
increasingly used in socially critical financial decision-making processes such as credit …

We describe an extension of automating induction in superposition-based reasoning by
strengthening inductive properties and generalizing terms over which induction should be …

Legal properties involve reasoning about data values and time. Metric first-order temporal
logic (MFOTL) provides a rich formalism for specifying legal properties. While MFOTL has …

Functional programs over inductively defined data types, such as lists, binary trees and
naturals, can naturally be defined using recursive equations over recursive functions. In first …

The problem of automatically proving the equality of terms over recursive functions and
inductive data types is challenging, as such proofs often require auxiliary lemmas which …

Several practical tools for automatically verifying functional programs (eg, Liquid Haskell
and Leon for Scala programs) rely on a heuristic based on unrolling recursive function …

Integers are ubiquitous in programming and therefore also in applications of program
analysis and verification. Such applications often require some sort of inductive reasoning …

Recent developments in deep neural networks (DNNs) have led to their adoption in safety-
critical systems, which in turn has heightened the need for guaranteeing their safety. These …

Recursively defined linked data structures embedded in a pointer-based heap and their
properties are naturally expressed in pure first-order logic with least fixpoint definitions (FO+ …

At Imandra Inc. we have pioneered the application of formal methods to financial algorithms
[3]. After nearly a decade of R&D and business development, our Imandra automated …