Section: Software

aCiNO

Participants : Fei He [ correspondant ] , Min Zhou.

aCiNO is a C++ implementation of Nelson-Oppen's architecture. It is intended to be a new and efficient SMT (Satisfiability Modulo Theory) solver. SMT is the problem of determining the satisfiability of a first-order logic formula in one or more decidable theories. It has been considered as the next generation of verification engines. We are going to develop this solver in an incremental way. We first aim at 2 popular theories, LRA (Linear Arithmetic) over real numbers and UF (Uninterpreted Functions). We use the simplex method to solve LRA and the congruence closure algorithm to solve UF. Both theories are combined under the Nelson-Oppen architecture. Newly discovered equalities between variables are therefore propagated to the other theory, so that the SMT solver is both SOUND and COMPLETE. We will integrate more theories into our solver on a by need basis.