SAT/SMT Constraint Solver Summer School 2011

[Vijay Ganesh]

Hello All,

We are organizing a Boolean SAT/SMT constraint solver summer school @ MIT from June, 12th to June 17th 2011. The website is:

http://people.csail.mit.edu/vganesh/summerschool

The Boolean Satisfiability Problem (and related SAT problems for rich theories) are of great interest to researchers in software reliability, AI, computer security, EDA/hardware verification and complexity theory. The dramatic improvements in the performance and applicability of SAT/SMT constraint solvers has led to their use in these diverse research fields.

The goal of the summer school is to connect researchers in these disparate communities in an informal setting and exchange ideas. Another goal is to connect new and current power users of SAT/SMT solvers with the developers.

The summer school has 33 lectures spread over 6 days given by 40 leading SAT/SMT researchers, power users and complexity theorists. It will be useful to anyone interested in using and/or developing SAT/SMT solvers.

Please do consider attending the summer school (along with your research group members). Please advertise this widely.

Thanks,
Vijay Ganesh.