[pl-seminar] Alex Aiken talk today @ 11

[kidd <kidd@xxxxxxxxxxx>]

Dr. Alex Aiken from Stanford University is presenting recent work today 
at 11 AM in room 3310. Cookies available at 10:45. The abstract is below.
See you there,
-Nick


----------------------------------------------------------------------
Static program analysis suffers from a fundamental trade-off between 
precision 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 techniques. We discuss one application in detail, 
a static memory leak detector, 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.