University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Craig Interpretation

Craig Interpretation

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

Abstract interpretation is one of the most scalable and automated approaches to program verification available today. To achieve efficiency, many steps of the analysis (e.g., join and widening) lose precision, thus producing false alarms.

In this talk, I will describe VINTA , an iterative algorithm for refining the results of abstract interpretation using Craig Interpolants and SMT solvers. Craig interpolants are used to recover the imprecision lost by abstract interpretation and guide the search towards a safe inductive invariant, or a real bug.

We have implemented VINTA in the LLVM compiler infrastructure and applied it to benchmarks from the software verification competition. Our results show that VINTA out-performs state-of-the-art verification tools.

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity