8-12 Aug 2011
Dagstuhl, Germany
SUMMER SCHOOL ON PROGRAM SYNTHESIS
August 8-12, 2011, Schloss Dagstuhl, Germany
details: http://www.cs.berkeley.edu/~bodik/dagstuhl-2011.html
When verification has reached industrial maturity, program synthesis
has appeared as the next research frontier. Building on the advances
in model checking, theorem proving, and machine learning, researchers
have used synthesis in program repair, algorithm synthesis, end-user
programming and several other areas.
This week-long school will present a carefully selected range of
complementary lectures that should prepare a student for research on
the open problems of program synthesis in a wide range of application
areas.
Topics
* Controller and automata synthesis
* Inductive synthesis and constraint-based synthesis
* Derivational and theorem-prover-based synthesis
* Learning-based synthesis
* Hands-on exercises and contests
Lectures
* Program Synthesis is a Game, Barbara Jobstmann , Verimag, CNRS
* SAT and SMT for Synthesis, Vijay Ganesh, MIT
* Software Development by Refinement, Doug Smith, Kestrel Institute
* AutoBayes and synthesis by program derivation, Johann Schumann, SGT, Inc. NASA Ames
* Constraint-based synthesis with Sketch, Armando Solar-Lezama, MIT
* Miscellaneous, Ras Bodik, UC Berkeley
Registration:
To apply, send email to bodik@cs.berkeley.edu by June 30.
Organizers
* Ras Bodik, UC Berkeley
* Sumit Gulwani, Microsoft Research
* Viktor Kuncak, EPFL
* Eran Yahav, Technion