You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

A Practical Approach to Satisfiability Modulo Linear Integer Arithmetic

Article type: Research Article

Authors: Griggio, Alberto; *

Affiliations: Fondazione Bruno Kessler - IRST, Via Sommarive 18, Povo, Trento, Italy. E-mail: [email protected]

Note: [*] Supported by Provincia Autonoma di Trento and the European Community’s FP7/2007-2013 under grant agreement Marie Curie FP7 - PCOFUND-GA-2008-226070 “progetto Trentino”, project ADAPTATION.

Keywords: SMT, linear integer arithmetic, decision procedures

DOI: 10.3233/SAT190086

Journal: Journal on Satisfiability, Boolean Modeling and Computation, vol. 8, no. 1-2, pp. 1-27, 2012

Received 1 April 2010
|
Revision received 1 February 2011
|
Published: 1 January 2012
Get PDF open access

Abstract

We present a detailed description of a theory solver for Linear Integer Arithmetic (LA(Z)) in a lazy SMT context. Rather than focusing on a single technique that guarantees theoretical completeness, the solver makes extensive use of layering and heuristics for combining different techniques in order to achieve good performance in practice. The viability of our approach is demonstrated by an empirical evaluation on a wide range of benchmarks, showing significant performance improvements over current state-of-the-art solvers.

Show more