BLT is a tool that takes programs written in the Boogie IVL and outputs first-order logic conjectures in the TPTP syntax, expressing the verification conditions. TPTP (stands for Thousands of Problems for Theorem Provers) is similar to the default Boogie target language, SMTLib, as they are both based on first-order logic and TPTP is considered as a widely accepted language standard for automated theorem provers. The verification conditions generated by BLT utilized some of the recent improvements of TPTP, hence we suggest to use BLT together with the Vampire theorem prover as its backend. BLT only supports a subset of the Boogie language at the moment, but we are working on the extension of BLT to further support the full language.
BLT is accepted by 13th International Conference on integrated Formal Methods (iFM 2017) under the title of “Triggerless Happy: Intermediate Verification with a First-Order Prover”.
Does BLT suit your interest? Or do you wish to use BLT for other research? Please feel free drop us a mail anytime!