Program

First Day (June 12th): SAT - (08:00 - 18:15)

  • 08:00 - 08:30. Registration
  • 08:30 - 08:45. Welcome and Introduction
  • 08.45 - 10:30. John Franco
    Foundations and theoretical aspects of SAT
  • 10:30 - 11:00. Coffee Break
  • 11:00 - 12.45. Armin Biere
    Modern CDCL SAT solvers
  • 12:45 - 14:15 Lunch
  • 14:15 - 16:00. Holger Hoos
    Meta-algorithmic techniques in SAT solving: automated configuration, selection and beyond
  • 16:00 - 16:30. Coffee Break
  • 16:30 - 18:15. Joao Marques-Silva
    MaxSAT and related optimization problems

Second Day (June 13th): SMT (08:45 - 18:15)

  • 08:45 - 10:30. Cesare Tinelli
    Foundations of lazy SMT and DPLL(T)
  • 10:30 - 11:00. Coffee Break
  • 11:00 - 12.45. Leonardo de Moura
    Quantifiers in SMT
  • 12:45 - 14:15. Lunch
  • 14:15 - 16:00. Silvio Ghilardi
    Combinations of theories in SMT
  • 16:00 - 16:30. Coffee Break
  • 16:30 - 18:15. Martin Fränzle
    SMT modulo Ordinary Differential Equations

Third Day (June 14th): Applications - Verification (08:45 - 18:15)

  • 08:45 - 10:30. Fabio Somenzi
    SAT-based model checking
  • 10:30 - 11:00. Coffee Break
  • 11:00 - 12:45. Ken McMillan
    SMT-based verification of software
  • 12:45 - 14:15. Lunch
  • 14:15 - 16:00. Patrice Godefroid
    Applications of SMT for test-case generation
  • 16:00 - 18.15. Poster Session

Fourth Day (June 15th): Applications - Planning, scheduling, and more (08:45 - 18:30)

  • 08:45 - 10:30. Jussi Rintanen
    Applications of SAT to planning
  • 10:30 - 11:00. Coffee Break
  • 11:00 - 12:45. Tomi Janhunen
    SAT and SMT for Answer Set Programming
  • 12:45 - 14:15. Lunch
  • 14:15 - 16:00. Bruno Dutertre
    SMT for fault-tolerant real-time systems
  • 16:00 - 16:30. Coffee Break
  • 16:30 - 18:15. Pete Manolios
    SMT for scheduling and synthesis of cyber-physical architectural models
  • 18:15 - 18:30. Concluding remarks and greetings