{"id":170118,"date":"2008-12-10T18:03:35","date_gmt":"2008-12-10T18:03:35","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/project\/boogie-an-intermediate-verification-language\/"},"modified":"2019-08-19T17:53:30","modified_gmt":"2019-08-20T00:53:30","slug":"boogie-an-intermediate-verification-language","status":"publish","type":"msr-project","link":"https:\/\/www.microsoft.com\/en-us\/research\/project\/boogie-an-intermediate-verification-language\/","title":{"rendered":"Boogie: An Intermediate Verification Language"},"content":{"rendered":"

Boogie is an intermediate verification language, intended as a layer on which to build program verifiers for other languages. Several program verifiers have been built in this way, including the VCC and HAVOC verifiers for C and the verifiers for Dafny, Chalice, and Spec#. A previous version of the language was called BoogiePL. The current language (version 2) is currently known as just Boogie, which is also the name of the verification tool that takes Boogie programs as input.<\/p>\n

\"\"<\/span><\/span>Boogie is also the name of a tool<\/b>. The tool accepts the Boogie language as input, optionally infers some invariants in the given Boogie program, and then generates verification conditions that are passed to an SMT solver. The default SMT solver is Z3<\/a>.\u00a0<\/span><\/span><\/div>\n
The Boogie research project is being developed primarily in the RiSE<\/a> group at Microsoft Research <\/a>in Redmond. However, people at several other institutions make the open-source Boogie tool what it is.<\/div>\n
\n