Alt-Ergo Explained

Alt-Ergo
Developer:OCamlPro
Programming Language:OCaml
Language:English
Genre:Mathematical solver, program verifier

Alt-Ergo, an automatic solver for mathematical formulas, is mainly used in formal program verification. It operates on the principle of satisfiability modulo theories (SMT). Development was undertaken by researchers at the Paris-Sud University, Laboratoire de Recherche en Informatique, Inria Saclay Ile-de-France, and CNRS. Since 2013, project management and oversight has been conducted by OCamlPro company.[1] It is released under the free and open-source software CeCILL-C license.

Technologies

Design choices

Alt-Ergo employs a specialized input language with prenex polymorphism, designed to reduce the number of axioms requiring quantification and to simplify the complexity of problems. While Alt-Ergo offers partial support for the SMT-LIB 2 language, its efficiency with SMT files is comparatively limited.

Main components

The core architecture of Alt-Ergo comprises three main elements: a depth-first search (DFS)-based SAT solver, a quantifiers instantiation engine that uses e-matching, and an assembly of decision procedures for a range of built-in theories. These components collectively enable Alt-Ergo's abilities in automatic formula solving.

Built-in theories

Alt-Ergo implements (semi-)decision procedures for the following theories:

Industrial uses

Several verification platforms are built on Alt-Ergo:

See also

External links

Notes and References

  1. Web site: About . 2023-06-15 . alt-ergo.ocamlpro.com.
  2. Web site: Why3 . 2023-06-15 . why3.lri.fr.
  3. Web site: The Alt-Ergo Theorem Prover: Academic Web Page . 2023-06-15 . alt-ergo.lri.fr.