Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Linear Integer Arithmetic Revisited

Martin Bromberger 1 Thomas Sturm 1, 2, 3, 4 Christoph Weidenbach 1
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est, MPII - Max-Planck-Institut für Informatik
3 MOSEL - Proof-oriented development of computer-based systems
LORIA - FM - Department of Formal Methods
Abstract : We consider feasibility of linear integer programs in the context of verification systems such as SMT solvers or theorem provers. Although satisfiability of linear integer programs is decidable, many state-of-the-art solvers neglect termination in favor of efficiency. It is challenging to design a solver that is both terminating and practically efficient. Recent work by Jovanovic and de Moura constitutes an important step into this direction. Their algorithm CUTSAT is sound, but does not terminate, in general. In this paper we extend their CUTSAT algorithm by refined inference rules, a new type of conflicting core, and a dedicated rule application strategy. This leads to our algorithm CUTSAT++, which guarantees termination.
Complete list of metadata
Contributor : Thomas Sturm Connect in order to contact the contributor
Submitted on : Thursday, February 18, 2021 - 9:39:59 AM
Last modification on : Saturday, October 16, 2021 - 11:26:09 AM

Links full text


  • HAL Id : hal-03145059, version 1
  • ARXIV : 1503.02948



Martin Bromberger, Thomas Sturm, Christoph Weidenbach. Linear Integer Arithmetic Revisited. 2015. ⟨hal-03145059⟩



Les métriques sont temporairement indisponibles