Exploiting Symmetry in SMT Problems

David Déharbe 1 Pascal Fontaine 2 Stephan Merz 2 Bruno Woltzenlogel Paleo 2
2 VERIDIS - VERIfication pour les systèmes DIStribués
Inria Nancy - Grand Est, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications : UMR7503
Abstract : Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance the performance of SMT-solvers by detecting symmetries in the input formulas and use them to prune the search space of the SMT algorithm. This technique is based on the concept of (syntactic) invariance by permutation of constants. An algorithm for solving SMT by taking advantage of such symmetries is presented. The implementation of this algorithm in the SMT-solver \veriT is used to illustrate the practical benefits of this approach. It results in a significant improvement of \veriT's performances on the SMT-LIB benchmarks that places it ahead of the winners of the last editions of the SMT-COMP contest in the QF\_UF category.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.inria.fr/inria-00617843
Contributor : Pascal Fontaine <>
Submitted on : Tuesday, August 30, 2011 - 3:53:59 PM
Last modification on : Thursday, February 21, 2019 - 2:02:02 PM

Links full text

Identifiers

Collections

Citation

David Déharbe, Pascal Fontaine, Stephan Merz, Bruno Woltzenlogel Paleo. Exploiting Symmetry in SMT Problems. International Conference on Automated Deduction (CADE), Jul 2011, Wroclaw, Poland. pp.222-236, ⟨10.1007/978-3-642-22438-6_18⟩. ⟨inria-00617843⟩

Share

Metrics

Record views

226