[pl-seminar] Visit by Alex Aiken

["Thomas Reps" <reps@xxxxxxxxxxx>]

This is a reminder that Alex Aiken will be visiting this Friday.
His talk will be at 11:00 AM so as to not conflict with
the departmental award ceremony in the afternoon.

Tom

--- Friday, April 28 ---
11:00 am, 3310 CS (Cookies: 10:45 am, 3310 CS)
Programming Languages Seminar: Alex Aiken, Stanford University,
"Scalable  Pro-
   gram Analysis Using Boolean Satisfiability"
   Static  program analysis suffers from a fundamental trade-off between
preci-
   sion and scalability, and the analyses that scale to  the  largest
programs
   invariably  are  generally  not  the  most precise methods known.
This talk
   describes how recent advances in algorithms for solving instances of
Boolean
   satisfiability  (SAT) can be exploited to relax this trade-off,
resulting in
   analyses that are both more precise and more scalable  than  existing
tech-
   niques.   We  discuss one application in detail, a static memory leak
detec-
   tor, illustrating how SAT-based analysis can model program behavior
down  to
   the  bit  level  while  still  scaling  to millions of lines of code.
Other
   applications and  some  of  the  challenges  encountered  in
applying  this
   approach to realistic software systems will be discussed as time
permits.