Theory Boogie

theory Boogie
imports Main
(*  Title:      HOL/SMT_Examples/Boogie.thy
    Author:     Sascha Boehme, TU Muenchen

section ‹Proving Boogie-generated verification conditions›

theory Boogie
imports Main
keywords "boogie_file" :: thy_load ("b2i")

text ‹
HOL-Boogie and its applications are described in:

\item Sascha B"ohme, K. Rustan M. Leino, and Burkhart Wolff.
HOL-Boogie --- An Interactive Prover for the Boogie Program-Verifier.
Theorem Proving in Higher Order Logics, 2008.

\item Sascha B"ohme, Micha{\l} Moskal, Wolfram Schulte, and Burkhart Wolff.
HOL-Boogie --- An Interactive Prover-Backend for the Verifying C Compiler.
Journal of Automated Reasoning, 2009.


section ‹Built-in types and functions of Boogie›

subsection ‹Integer arithmetics›

text ‹
The operations ‹div› and ‹mod› are built-in in Boogie, but
without a particular semantics due to different interpretations in
programming languages. We assume that each application comes with a
proper axiomatization.

  boogie_div :: "int ⇒ int ⇒ int" (infixl "div'_b" 70) and
  boogie_mod :: "int ⇒ int ⇒ int" (infixl "mod'_b" 70)

section ‹Setup›

ML_file "boogie.ML"

section ‹Verification condition proofs›

declare [[smt_oracle = false]]
declare [[smt_read_only_certificates = true]]

declare [[smt_certificates = "Boogie_Max.certs"]]

boogie_file Boogie_Max

declare [[smt_certificates = "Boogie_Dijkstra.certs"]]

boogie_file Boogie_Dijkstra

declare [[z3_extensions = true]]
declare [[smt_certificates = "VCC_Max.certs"]]

boogie_file VCC_Max