Page History

h1. Welcome to the {color:#0000ff}{*}+[First International SAT/SMT Summer School 2011|http://people.csail.mit.edu/vganesh/summerschool]+{*}{color}


h1. Lectures Schedule

|| Time || 08:30-08:45 || 08-45:09:45 || 09:45-10:15 || 10:15-11:15 || 11:30-12:30 || 12:30-14:00 || 14:00-15:00 || 15:15-16:15 || 16:15-16:45 || 16:45-17:45 ||
|| Sunday 12 || Opening (Vijay Ganesh) | {bgcolor:blue}[The P vs. NP Question and Gödel's Lost Letter (Richard Lipton)|PvsNP]\\  \\
\\ \\
\\
 {bgcolor} || Coffee break | {bgcolor:blue}[Foundations of Modern CDCL SAT Solver Implementation (Niklas Een)|FoundationsSat] {bgcolor} | {bgcolor:orange}[Klee: An SMT Solver-based Dynamic Symbolic Testing Tool (Cristian Cadar)|Klee] {bgcolor} || Lunch | {bgcolor:orange}[SAT Solvers for Formal Verification (Ed Clarke)|SatFormalVerification] {bgcolor} | {bgcolor:blue}[SMT-LIB Initiative (Cesare Tinelli)|SmtLib] {bgcolor} || Coffee break | {bgcolor:blue}[SMT Theory and DPLL(T) (Albert Oliveras)|FoundationsSmt] {bgcolor} ||


|| Time || Monday 13 || Tuesday 14 || Wed. 15 || Thursday 16 || Friday 17 ||
|| 08:30-09:30 | {bgcolor:blue}[Independence Results for the P vs. NP Question (Shai Ben David)|Independence] {bgcolor} | {bgcolor:orange}TBA (Sharad Malik) {bgcolor} | {bgcolor:blue}Complexity Theoretic Aspects of the Boolean SAT Problem {bgcolor} | {bgcolor:yellow}SAT solving in AI (Henry Kautz) {bgcolor} | {bgcolor:blue}Proof Complexity and Complexity of SAT Solvers {bgcolor} ||
|| 09:30-10:00 || Coffee break || Coffee break || Coffee break || Coffee break || Coffee break ||
|| 10:00-11:00 | {bgcolor:blue}[Modern SMT Solver Implementation (Leonardo De Moura& Nikolaj Bjorner)|ModernSMT] {bgcolor} | {bgcolor:orange}BitBlaze & WebBlaze: Tools for computer security using SMT Solvers (Dawn Song & Prateek Saxena){bgcolor} | {bgcolor:blue}[Approaches to Parallel SAT Solving (Youssef Hamadi)|ParallelSat]\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\ \\
\\
 {bgcolor} | {bgcolor:orange}HAVOC: SMT solvers for precise and scalable reasoning of programs{bgcolor} | {bgcolor:orange}Harnessing SMT power using the verification engine Boogie {bgcolor} ||
|| 11:15-12:15 | {bgcolor:yellow}[HAMPI: A Solver for String Theories (Vijay Ganesh)|Hampi] {bgcolor} | {bgcolor:yellow}Yices and Applications{bgcolor} | {bgcolor:yellow}Alloy/Kodkod and Applications (Emina Torlak){bgcolor} | {bgcolor:yellow}OpenSMT and Applications{bgcolor} | {bgcolor:yellow}MathSAT and Applications{bgcolor} ||
|| 12:15-14:00 || Lunch || Lunch || Lunch || Lunch || Lunch ||
|| 14:00-15:00 | {bgcolor:yellow}[Calculus of Data Structures for Verification and Synthesis (Viktor Kuncak)|CalculusDataStructure]\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\ \\
\\
 {bgcolor} | {bgcolor:yellow}SAT-based Model-Checking (Armin Biere){bgcolor} | {bgcolor:blue}[MaxSAT for Optimization Problems (Joao Marques-Silva)|MaxSAT]\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\ \\
\\
 {bgcolor} | {bgcolor:orange}Liquid Types: SMT Solver-based Types{bgcolor} | {bgcolor:blue}Empirical Complexity (Holger Hoos){bgcolor} \\ ||
|| 15:15-16:15 | {bgcolor:yellow}[CVC3 and Applications (Clark Barrett)|Cvc3]\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\ \\
\\
 {bgcolor} | {bgcolor:yellow}[CryptoMiniSAT: A SAT Solver for Cryptography (Mate Soos)|Cryptominisat]\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\ \\
\\
 {bgcolor} | {bgcolor:yellow}[SAT4J: pseudo-boolean optimization & dependency management problems|Sat4j]\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\ \\
\\
 {bgcolor} | {bgcolor:yellow}[UCLID and Applications|Uclid]{bgcolor} | {bgcolor:orange}[SMT Solver-based Compiler Optimization Verification |CompilerOptimizationVerification]\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\ \\
\\
 {bgcolor} ||
|| 16:15-16:45 || Coffee break || Coffee break || Coffee break || Coffee break || Coffee break ||
|| 16:45-17:45 | {bgcolor:orange}[CEGAR+SMT: Formal Verification of Control Logic in the Reveal System (Karem Sakallah)|CegarSmt] {bgcolor} | {bgcolor:orange}[SAGE: Automated Whitebox Fuzzing using SMT solvers|Sage]\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\ \\
\\
 {bgcolor} | {bgcolor:orange}[Parallelized Software Testing at Scale using SMT Solvers|ParallelizedSoftwareTestingSmt]\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\ \\
\\
 {bgcolor} | {bgcolor:orange}[Sketching: Program Synthesis using SAT Solvers (Armando Solar-Lezama)|Sketching]\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\  \\
\\ \\
\\
 {bgcolor} | {bgcolor:blue}[Non-DPLL Approaches to Boolean SAT Solving|NonDpll] {bgcolor} ||

h1. {color:#0000ff}[Class Website on MIT Stellar Course Site|http://stellar.mit.edu/S/project/satsmtschool11/]{color}