1 / 7

Building an Automatic Program Verifier: Insights and Demonstrations

This lecture by K. Rustan M. Leino at the 2011 LASER Summer School provides a comprehensive overview of automatic program verification, emphasizing termination proofs through variant functions. Students learn the fundamentals of expressing proofs and implementing them in practical demonstrations. The lecture covers essential topics such as lemmas, induction, and interactive exercises, illustrated by live coding in Dafny. This session aims to equip participants with the knowledge to apply program verification techniques effectively in their software development practices.

ringo
Télécharger la présentation

Building an Automatic Program Verifier: Insights and Demonstrations

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Using and Building an Automatic Program Verifier K. Rustan M. Leino Research in Software Engineering (RiSE) Microsoft Research, Redmond Lecture 2 LASER Summer School 2011 Elba, Italy 7 September 2011

  2. Termination • A variant function is an expression whose values goes down (in some well-founded ordering) with every iteration/call At the time of the call, the callee’s variant function must be less than the caller’s while (B){ S;} method M(){ P();} At the time a loop back-edge is taken, the value of the variant function must be less than at the beginning of the iteration

  3. Proving termination demo Termination

  4. Motivation for using lemmas demo FindZero

  5. Lemmas, induction demo Gauss2

  6. Exercises • McCarthy • http://rise4fun.com/Dafny/6bq • Coincidence • http://rise4fun.com/Dafny/WvG • Saddleback search • http://rise4fun.com/Dafny/U5h • Max is transitive • http://rise4fun.com/Dafny/z9J • Reverse-Reverse • http://rise4fun.com/Dafny/1g

  7. Links • Dafny • research.microsoft.com/dafny • rise4fun.com/Dafny/tutorial/guide • rise4fun • rise4fun.com • Verification Corner • research.microsoft.com/verificationcorner

More Related