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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Wintersteiger, C. M., Hamadi, Y., & De Moura, L. (2009). A Concurrent Portfolio Approach to SMT Solving. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5643 LNCS, pp. 715–720). https://doi.org/10.1007/978-3-642-02658-4_60
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
