PS: Cookies starting at 3:45, if the talk wasnât incentive enough to go.
If you don't have class, you should definitely attend Akash's talk today.
-----
Inferring Annotations from Verification Histories [2]Monday, April 18, 2016 - 4:00pm to 5:00pm 1240 CS Akash LalMicrosoft Research IndiaFinding invariants is an important step in automated program analysis.Discovery of precise invariants, however, can be very difficult in practice.The problem can be simplified if one has access to a candidate set ofpredicates (or annotations) and the search for invariants is limited over thespace defined by these annotations.We present an approach that infers program annotations automatically byleveraging the history of verifying related programs. Our algorithm extractshigh-quality annotations from previous verification attempts, and thenapplies them for verifying new programs. We present a case study where weapplied our techniques to Microsoft's Static Driver Verifier (SDV).SDV currently uses manually-tuned heuristics for obtaining a set ofannotations. Our techniques not only can replace the need for this manualeffort, they even outperform these heuristics and improve the performance ofSDV overall.Speaker's Bio: Akash Lal is a Researcher at Microsoft Research India, whichhe joined in 2009 after receiving his Ph.D. from the Computer SciencesDepartment of the University of Wisconsin-Madison. For his thesis, he was aco-recipient of both the UW CS Outstanding Graduate Student Research Awardand the ACM SIGPLAN Outstanding Doctoral Dissertation Award. In 2011, Akashwas named to MIT Technology Review's 2011 India TR-35 list (top innovatorsunder 35).
_______________________________________________ Pl-seminar mailing list Pl-seminar@xxxxxxxxxxxhttps://lists.cs.wisc.edu/mailman/listinfo/pl-seminar
|
|