A Concurrent Portfolio Approach to SMT Solving

  • Christoph M. Wintersteiger
  • Youssef Hamadi
  • Leonardo de Moura
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5643)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Christoph M. Wintersteiger
    • 1
  • Youssef Hamadi
    • 2
  • Leonardo de Moura
    • 3
  1. 1.Computer Systems InstituteETH ZurichSwitzerland
  2. 2.Microsoft Research CambridgeCambridgeUK
  3. 3.Microsoft Research, One Microsoft WayRedmondUSA

Personalised recommendations