Lectures Schedule
Legend |
|
|
|
|---|
Each lecture lasts one hour (1:00) for single speaker, and one hour fifteen minutes (1:15) for dual speakers.
Sunday, June 12, special schedule
Time | 08:30-09:30 | 09:30-10:00 | 10:00-11:00 | 11:00-11:30 | 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 | Welcome coffee |
| Coffee break |
| Lunch |
|
| Coffee break |
|
Monday, June 13 to Friday, June 17, regular schedule
Time | Monday 13 |
|---|
Welcome to the First International SAT/SMT Summer School 2011
Lecturers
Lecture Schedule
Time | Sunday 12 | Monday 13 | Tuesday 14 | Wed. 15 | Thursday 16 | Friday 17 | ||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
08:30-09:30 |
|
| Complexity Theoretic Aspects of the Boolean SAT Problem |
|
|
|
| |||||||||||||||||||||||||||||||||||
09: | 30-10h00 Coffee break | 45-10:45 |
|
|
| 10:00-11:00 | Foundations of Modern CDCL SAT Solver Implementation (Niklas Een) | Modern SMT Solver Implementation (Leonardo DeMoura & Nikolaj Bjorner) |
|
|
|
|
| |||||||||||||||||||||||||||||
10:45-11:15 | Coffee break | Coffee break | Coffee break | Coffee break | Coffee break | |||||||||||||||||||||||||||||||||||||
11:15-12:30 |
|
|
|
|
|
|
|
|
| |||||||||||||||||||||||||||||||||
12-30 | 12:15-14:00 | Lunch | Lunch | Lunch | Lunch | Lunch | ||||||||||||||||||||||||||||||||||||
14:00-15:00 | 14:00-15:15
|
|
|
|
|
|
| |||||||||||||||||||||||||||||||||||
15:15-16:15 | SMT-LIB Initiative (Cesare Tinelli) | 15:30-16:30
|
|
|
|
|
|
| ||||||||||||||||||||||||||||||||||
16:15-16:45 | 16:30-17:00 | Coffee break | Coffee break | Coffee break | Coffee break | |||||||||||||||||||||||||||||||||||||
16:45-17h45/18:00 | 17:45 | SMT Theory and DPLL(T) (Albert Oliveras) | Non-DPLL Approaches to Boolean SAT Solving |
| SAT solving in AI |
|
|
...
00-18:00
|
|
|
|
|
Class Website on MIT Stellar Course Site
UCLID's Elements: Term-Level Verification and SMT Solving
| Column | ||
|---|---|---|
| ||
|
...
| width | 5% |
|---|
...
| width | 35% |
|---|
...
Navigate space
...
| Page Tree Search |
|---|
...