BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Colloquium : Program Synthesis: New Strides in an Old Problem
DTSTART:20171026T161500
DTEND:20171026T173000
DTSTAMP:20260406T204213Z
UID:4ef046b2fce4ae66f281223bf74b2e21666bdc0a836aa1a438eec47c
CATEGORIES:Conferences - Seminars
DESCRIPTION:By: Swarat Chaudhuri - Rice University\nVideo of his talk\n\nA
 bstract:\nProgram synthesis\, the problem of automatically discovering sol
 utions to programming tasks\, is a long-standing goal in computer science.
  The problem is known to be extremely hard\, primarily because it requires
  search through vast\, combinatorial spaces of programs. Nevertheless\, th
 e last decade has seen a resurgence of interest in this area. New algorith
 mic techniques\, new applications\, diligent engineering\, and the availab
 ility of powerful hardware have contributed to raising hopes for practical
  program synthesis.\n\nIn this talk\, I will discuss some of the algorithm
 ic insights that we have identified while working on program synthesis ove
 r the last eight years. Specifically\, I will show that functional languag
 e abstractions and the use of automated deduction can be key to scaling pr
 ogram synthesis. I will demonstrate that data-driven methods -- in particu
 lar\, statistical learning over large corpora of code -- can speed up sear
 ches for programs and enable synthesis from highly\nambiguous specificatio
 ns of programming tasks. Finally\, I will discuss a quantitative extension
  of program synthesis and show that continuous optimization methods and le
 arning from data can be useful in solving this problem.\n\nBio:\nSwarat Ch
 audhuri is an Associate Professor of Computer Science at Rice University. 
 His research has two main thrusts: (a) algorithms\, based on automated ded
 uction\, combinatorial search and optimization\, and statistical machine l
 earning\, for program analysis and synthesis\; and (b) the use of these al
 gorithms in practical tools for increasing programmer productivity. The ap
 plications that motivate his work come from a mix of areas\, including ind
 ustrial software engineering\, end-user programming\, multiagent systems\,
  and robotics and cyber-physical systems.\nSwarat received a bachelor's de
 gree in computer science from the Indian Institute of Technology\, Kharagp
 ur\, in 2001\, and a doctoral degree in computer science from the Universi
 ty of Pennsylvania in 2007. From 2008-2011\, he was an Assistant Professor
  at the Pennsylvania State University\, University Park. He is a recipient
  of the National Science Foundation CAREER award and the ACM SIGPLAN John 
 Reynolds Doctoral Dissertation Award. He has served on the committee of ma
 ny conferences in formal methods and programming languages\, and chaired t
 he 2016 Conference on Computer-Aided Verification (CAV).\n\nMore informati
 on
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR