A Concurrent Portfolio Approach to SMT Solving
With the availability of multi-core processors and large-scale computing clusters, the study of parallel algorithms has been revived throughout the industry. We present a portfolio approach to deciding the satisfiability of SMT formulas, based on the recent success of related algorithms for the SAT problem. Our parallel version of Z3 outperforms the sequential solver, with speedups of well over an order of magnitude on many benchmarks.
Unable to display preview. Download preview PDF.
- 3.de Moura, L., Bjørner, N.: Model-based Theory Combination. In: SMT 2007 (2007)Google Scholar
- 5.Hamadi, Y., Jabbour, S., Sais, L.: ManySAT: A Parallel SAT Solver. Journal of Satisfiability (2008) (to appear)Google Scholar
- 6.Hamadi, Y., Jabbour, S., Sais, L.: ManySAT: Solver Description. Technical Report MSR-TR-2008-83, Microsoft Research (May 2008)Google Scholar