FrankenBit: Bit-Precise Verification with Many Bits

(Competition Contribution)
  • Arie Gurfinkel
  • Anton Belov
Conference paper

DOI: 10.1007/978-3-642-54862-8_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8413)
Cite this paper as:
Gurfinkel A., Belov A. (2014) FrankenBit: Bit-Precise Verification with Many Bits. In: Ábrahám E., Havelund K. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2014. Lecture Notes in Computer Science, vol 8413. Springer, Berlin, Heidelberg

Abstract

Bit-precise software verification is an important and difficult problem. While there has been an amazing progress in SAT solving, Satisfiability Modulo Theory of Bit Vectors, and bit-precise Bounded Model Checking, proving bit-precise safety, i.e. synthesizing a safe inductive invariant, remains a challenge. In this paper, we present FrankenBit — a tool that combines bit-precise invariant synthesis with BMC counterexample search. As the name suggests, FrankenBit combines a large variety of existing verification tools and techniques, including LLBMC, UFO, Z3, Boolector, MiniSAT and STP.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Arie Gurfinkel
    • 1
  • Anton Belov
    • 2
  1. 1.Carnegie Mellon Software Engineering InstituteUSA
  2. 2.University College DublinIreland

Personalised recommendations