Speaker Nikolaj Bjorner, Joao Marques-Silva, and Youssef Hamadi
Affiliation Microsoft Research, UCD, MSRC
Host Judith Bishop
Date recorded 15 April 2011
Boolean SAT/SMT solvers have seen dramatic progress in the last decade, and are being used in a diverse set of applications such as program analysis, testing, formal methods, program synthesis, computer security, AI and biology. Given the rather dramatic explosion in the usage scenarios of SAT/SMT solvers, there is great demand for newer kinds of features and higher levels of performance required of these solvers. This session will highlight recent developments around SMT, MAX-SAT, and parallel SAT engines.
©2011 Microsoft Corporation. All rights reserved.