A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic

François Bobot 1, 2 Sylvain Conchon 2 Evelyne Contejean 2 Mohamed Iguernelala 2 Assia Mahboubi 3, 4, 5, 6 Alain Mebsout 2 Guillaume Melquiond 1, 2
1 PROVAL - Proof of Programs
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR
2 LRI - Laboratoire de Recherche en Informatique
3 SPECFUN - Symbolic Special Functions : Fast and Certified
Inria Saclay - Ile de France
4 MSR - INRIA - Microsoft Research - Inria Joint Centre
5 TYPICAL - Types, Logic and computing
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
6 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : This paper describes a novel decision procedure for quantifier-free linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domain and then proceed either by projection (e.g. Omega-Test) or by branching/cutting methods (branch-and-bound, branch-and-cut, Gomory cuts). Our approach tries to bridge the gap between the two techniques: it interleaves an exhaustive search for a model with bounds inference. These bounds are computed provided an oracle capable of finding constant positive linear combinations of affine forms. We also show how to design an efficient oracle based on the Simplex procedure. Our algorithm is proved sound, complete, and terminating and is implemented in the Alt-Ergo theorem prover. Experimental results are promising and show that our approach is competitive with state-of-the-art SMT solvers.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download
https://hal.inria.fr/hal-00687640
Contributor : Guillaume Melquiond <>
Submitted on : Monday, April 16, 2012 - 7:08:01 PM
Last modification on : Monday, December 9, 2019 - 5:24:04 PM
Long-term archiving on: Wednesday, December 14, 2016 - 11:31:46 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

CNRS | INRIA | LIX | X | PARISTECH | X-LIX | UMR8623 | LRI-VALS | X-DEP-INFO

Citation

François Bobot, Sylvain Conchon, Evelyne Contejean, Mohamed Iguernelala, Assia Mahboubi, et al.. A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic. 6th International Joint Conference on Automated Reasoning, Jun 2012, Manchester, United Kingdom. pp.67-81, ⟨10.1007/978-3-642-31365-3_8⟩. ⟨hal-00687640v2⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

1185

Files downloads

1196

 

 

Contact

archive-ouverte@inria.fr