University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Practical Boogie (on the example of VCC)

Practical Boogie (on the example of VCC)

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

I’m going to talk about encoding various constructs in Boogie. In particular I’ll focus on object invariants, as implemented in VCC , and what can be built on them: ownership, counting permissions for concurrent programs, recursive data-structures, and secrecy properties. I’ll also talk about encoding data-types, termination checking, and induction proofs.

VCC is a verifier of complex, user-supplied properties of concurrent C programs. It builds on top of Boogie, an intermediate verification language, generating verification conditions for various provers including Z3.

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