Lectures Schedule
Legend |
Unknown macro: {bgcolor} Category 1: Foundational Aspects of SAT/SMT Solvers |
Unknown macro: {bgcolor} Category 2: Description of SAT/SMT Solvers with tight focus on an application |
Unknown macro: {bgcolor} Category 3: Description of tools using SAT/SMT Solvers |
|---|
Each lecture lasts one hour (1:00) for single speaker, and one hour fifteen minutes (1:15) for dual speakers.
Sunday, June 12, specific 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) |
Unknown macro: {bgcolor} The P vs. NP Question and Gödel's Lost Letter (Richard Lipton) |
Coffee break |
Unknown macro: {bgcolor} Introduction to Satisfiability Solving with Practical Applications (Niklas Een) |
Unknown macro: {bgcolor} |
Lunch |
Unknown macro: {bgcolor} |
Unknown macro: {bgcolor} |
Coffee break |
Unknown macro: {bgcolor} Klee: An SMT Solver-based Dynamic Symbolic Testing Tool (Cristian Cadar) |
June 13-17, regular schedule
Time |
Monday 13 |
Tuesday 14 |
Wed. 15 |
Thursday 16 |
Friday 17 |
|---|---|---|---|---|---|
08:30-09:30 |
Unknown macro: {bgcolor} Independence Results for the P vs. NP Question (Shai Ben David) |
Unknown macro: {bgcolor} |
Unknown macro: {bgcolor} Calculus of Data Structures for Verification and Synthesis (Ruzica Piskac) |
Unknown macro: {bgcolor} |
Unknown macro: {bgcolor}
|
09:45-10:45 |
Unknown macro: {bgcolor} |
Unknown macro: {bgcolor} |
Unknown macro: {bgcolor}
|
Unknown macro: {bgcolor} Sketching: Program Synthesis using SAT Solvers (Armando Solar-Lezama) |
Unknown macro: {bgcolor} Harnessing SMT power using the verification engine Boogie (Rustan Leino) |
10:45-11:15 |
Coffee break |
Coffee break |
Coffee break |
Coffee break |
Coffee break |
11:15-12:30 |
Unknown macro: {bgcolor} Modern SMT Solver Implementation (Leonardo De Moura& Nikolaj Bjorner) |
Unknown macro: {bgcolor} BitBlaze & WebBlaze: Tools for computer security using SMT Solvers (Dawn Song & Prateek Saxena) |
Unknown macro: {bgcolor}
|
Unknown macro: {bgcolor}
|
Unknown macro: {bgcolor} HAVOC: SMT solvers for precise and scalable reasoning of programs (Shuvendu Lahiri & Shaz Qadeer) |
12-30-14:00 |
Lunch |
Lunch |
Lunch |
Lunch |
Lunch |
14:00-15:00 |
Unknown macro: {bgcolor} [Scalable Testing/Reverse Engineering/Performance Profiling with Parallel and Selective Symbolic Execution (George Candea & Stefan Bucur)] |
Unknown macro: {bgcolor}
|
Unknown macro: {bgcolor} |
Unknown macro: {bgcolor} |
Unknown macro: {bgcolor} Non-DPLL Approaches to Boolean SAT Solving (Bart Selman & Carla Gomes) |
15:15-16:15 |
Unknown macro: {bgcolor}
|
Unknown macro: {bgcolor}
|
Unknown macro: {bgcolor} SAT4J: pseudo-boolean optimization & dependency management problems (Daniel Le Berre) |
Unknown macro: {bgcolor} |
Unknown macro: {bgcolor} SMT Solver-based Compiler Optimization Verification (Sorin Lerner) |
16:15-16:45 |
Coffee break |
Coffee break |
Coffee break |
Coffee break |
Coffee break |
16:45-17h45/18:00 |
Unknown macro: {bgcolor} CEGAR+SMT: Formal Verification of Control Logic in the Reveal System (Karem Sakallah) |
Unknown macro: {bgcolor} SAGE: Automated Whitebox Fuzzing using SMT solvers (Patrice Godefroid & David Molnar) |
Unknown macro: {bgcolor} Complexity Theoretic Aspects of the Boolean SAT Problem (Ryan Williams) |
Unknown macro: {bgcolor} OpenSMT and Applications (Roberto Bruttomesso & Natasha Sharygina) |
Unknown macro: {bgcolor} Symbolic Execution and Automated Exploit Generation (David Brumley) |
