Theorem Proving in Higher Order Logics

Volume 5170 of the series Lecture Notes in Computer Science pp 150-166

HOL-Boogie — An Interactive Prover for the Boogie Program-Verifier

  • Sascha BöhmeAffiliated withTechnische Universität München
  • , K. Rustan M. LeinoAffiliated withMicrosoft Research, Redmond
  • , Burkhart WolffAffiliated withUniversität Saarbrücken

* Final gross prices may vary according to local VAT.

Get Access


Boogie is a program verification condition generator for an imperative core language. It has front-ends for the programming languages C# and C enriched by annotations in first-order logic.

Its verification conditions — constructed via a wp calculus from these annotations — are usually transferred to automated theorem provers such as Simplify or Z3. In this paper, however, we present a proof-environment, HOL-BoogieP, that combines Boogie with the interactive theorem prover Isabelle/HOL. In particular, we present specific techniques combining automated and interactive proof methods for code-verification.

We will exploit our proof-environment in two ways: First, we present scenarios to ”debug” annotations (in particular: invariants) by interactive proofs. Second, we use our environment also to verify ”background theories”, i.e. theories for data-types used in annotations as well as memory and machine models underlying the verification method for C.