![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
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. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsNetworks & Neuroscience Climate Change and Sustainability in Multiple Dimensions Dio-Gandhi equationsOther talksCooperation, Construction, Coercion, Consent: Understanding the Role of Reimagined Urban Space within Nazi Germany and Fascist Italy Exhibiting Ice Age Cambridge Using vision to understand dementia in Parkinson’s disease Disaggregating goods Arithmetic and Dynamics on Markoff-Hurwitz Varieties Climate change, archaeology and tradition in an Alaskan Yup'ik Village |