You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 57 Next »

First International SAT/SMT Summer School 2011">Welcome to the First International SAT/SMT Summer School 2011

Lectures Schedule

Time

Sunday 12

Monday 13

Tuesday 14

Wed. 15

Thursday 16

Friday 17

08:30-09:30

Unknown macro: {bgcolor}

TBA (Sharad Malik)

Unknown macro: {bgcolor}

Complexity Theoretic Aspects of the Boolean SAT Problem

SAT solving in AI (Henry Kautz)

Unknown macro: {bgcolor}

Proof Complexity and Complexity of SAT Solvers

09:30-10h00

Coffee break

Coffee break

Coffee break

Coffee break

Coffee break

Coffee break

10:00-11:00

Unknown macro: {bgcolor}

BitBlaze & WebBlaze: Tools for computer security using SMT Solvers (Dawn Song & Prateek Saxena)

Unknown macro: {bgcolor}

Approaches to Parallel SAT Solving (Youssef Hamadi)

Unknown macro: {bgcolor}

HAVOC: SMT solvers for precise and scalable reasoning of programs

Unknown macro: {bgcolor}

Harnessing SMT power using the verification engine Boogie

11:15-12:15

Unknown macro: {bgcolor}

Yices and Applications

Unknown macro: {bgcolor}

Alloy/Kodkod and Applications (Emina Torlak)

Unknown macro: {bgcolor}

OpenSMT and Applications

Unknown macro: {bgcolor}

MathSAT and Applications

12:15-14:00

Lunch

Lunch

Lunch

Lunch

Lunch

Lunch

14:00-15:00

SAT-based Model-Checking (Armin Biere)

MaxSAT for Optimization Problems (Joao Marques-Silva)

Liquid Types: SMT Solver-based Types

Empirical Complexity (Holger Hoos)

15:15-16:15

Unknown macro: {bgcolor}

SMT-LIB Initiative (Cesare Tinelli) ||

Unknown macro: {bgcolor}

CVC3 and Applications (Clark Barrett)

CryptoMiniSAT: A SAT Solver for Cryptography (Mate Soos)

SAT4J: pseudo-boolean optimization & dependency management problems

UCLID and Applications

SMT Solver-based Compiler Optimization Verification

16:15-16:45

Coffee break

Coffee break

Coffee break

Coffee break

Coffee break

Coffee break

16:45-17:45

SAGE: Automated Whitebox Fuzzing using SMT solvers

[Parallelized Software Testing at Scale using SMT Solvers]

Sketching: Program Synthesis using SAT Solvers (Armando Solar-Lezama)

Non-DPLL Approaches to Boolean SAT Solving

Class Website on MIT Stellar Course Site">Class Website on MIT Stellar Course Site

  • No labels