This website is no longer updated

To discover our news and more



Follow this link

Overview

Alt-Ergo is an open-source SMT solver dedicated to the proof of mathematical formulas generated in the context of program verification. It is built upon CC(X): a congruence closure algorithm parametrized by a Shostak theory X. Currently, Alt-Ergo provides a built-in support for the following theories:

the free theory of equality with uninterpreted symbols,

linear arithmetic over integers and rationals,

non-linear arithmetic,

polymorphic functional arrays,

enumerated datatypes,

record datatypes,

associative and commutative (AC) symbols,

fixed-size bit-vectors.

Alt-Ergo is highly parametrized and modular. Each component is described by a set of inference rules and is implemented as an OCaml (parametrized) module. Its native input language is a polymorphic first-order logic modulo theories. It also provides a partial support for the SMT-LIB (v1.2 and v2) standard inputs. Since September 2013, Alt-Ergo is maintained and distributed by the OCamlPro company, while academic research is conducted in partnership with the VALS/Toccata teams (LRI).

Research Projects Involving Alt-Ergo

Related Publications

Arithmetic

Shostak-like theories combination

Quantifiers

Certification

Theses