BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/646
DTSTAMP:20230914T125932Z
SUMMARY:A Theory of Algorithmic Improvisation
DESCRIPTION:Speaker: Sanjit A. Seshia (University of California at Berkeley
 \nDepartment of Electrical Engineering\nand Computer Sciences\n253 Cory Ha
 ll\nBerkeley\, CA 94720-1770\nUnited States of Anerica\n )\n\nAbstract: \
 nAbstract: Improvisation is often described as "acting without preparation
 "\, with an element of randomness. Can an algorithm improvise? What does i
 t mean for an algorithm to improvise? What applications can benefit from a
 lgorithmic improvisation?\n\nIn this talk\, I will explore these questions
  by presenting "control improvisation"\, a formalization of the notion of 
 algorithmic improvisation. A simple form of control improvisation is to fi
 nd a random generator of strings from a formal language satisfying certain
  hard\, soft\, and randomness requirements. Applications of control improv
 isation are surprisingly diverse\, ranging from robotics to software testi
 ng to computational music. I will present the theory of control improvisat
 ion\, an analysis of its computational complexity\, and some preliminary a
 pplications that we have explored at Berkeley.\n\nBio: Sanjit A. Seshia is
  an Associate Professor in the Department of Electrical Engineering and Co
 mputer Sciences at the University of California\, Berkeley. He received an
  M.S. and Ph.D. in Computer Science from Carnegie Mellon University\, and 
 a B.Tech. in Computer Science and Engineering from the Indian Institute of
  Technology\, Bombay. His research interests are in dependable computing a
 nd computational logic\, with a current focus on applying automated formal
  methods to problems in cyber-physical systems\, computer security\, elect
 ronic design automation\, and synthetic biology. His Ph.D. thesis work on 
 the UCLID verifier and decision procedure helped pioneer the area of satis
 fiability modulo theories (SMT) and SMT-based verification. He is co-autho
 r of a textbook on embedded systems used in more than 50 countries and has
  led the development of technologies for cyber-physical systems education 
 based on formal methods. His awards and honors include a Presidential Earl
 y Career Award for Scientists and Engineers (PECASE) from the White House\
 , an Alfred P. Sloan Research Fellowship\, and the School of Computer Scie
 nce Distinguished Dissertation Award at Carnegie Mellon University.\n \n
URL:https://www.tcs.tifr.res.in/web/events/646
DTSTART;TZID=Asia/Kolkata:20160111T110000
DTEND;TZID=Asia/Kolkata:20160111T120000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR
