BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:What's decidable for Asynchronous Programs?
DTSTART:20090302T161500
DTSTAMP:20260407T152518Z
UID:af8339bdce37fa18a5a7947559154fc6ec60445ef9a08895d2c13abc
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Rupak Majumdar\, University of California\, Los Angeles\
 , USA\nAn asynchronous or ``event-driven'' program is one that contains pr
 ocedure calls which are not directly executed from the callsite\, but stor
 ed and executed later by an external scheduler. \nBy providing a low-overh
 ead way to manage concurrent interactions\, asynchronous programs form the
  core of many server programs\, embedded systems\, and popular programming
  styles for the web (Ajax).\nUnfortunately\, such programs can be hard to 
 write and maintain as sequential control flow needs to be split into sever
 al disjoint handlers.\nThey are a challenge for static analysis tools as t
 hey are infinite state:both the program stack and the number of outstandin
 g asynchronous requests may be unbounded.\nWe show that safety and livenes
 s properties can be checked effectively for the class of Boolean asynchron
 ous programs\, thus enabling automatic static techniques to check for corr
 ectness or for errors.  \n\nBio:\nRupak Majumdar is an Associate Professor
  in the Department of Computer Science at the University of California\, L
 os Angeles. His research interests are in the design and verification of r
 eactive hardware and software systems. He received the President's Gold Me
 dal from IIT\, Kanpur\, the Leon O. Chua award from UC Berkeley\, and an N
 SF CAREER award.\n\nR. Majumdar's homepage
LOCATION:INM202
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR