Boom: Taking Boolean Program Model Checking One Step Further

  • Gerard Basler
  • Matthew Hague
  • Daniel Kroening
  • C. -H. Luke Ong
  • Thomas Wahl
  • Haoxian Zhao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6015)

Abstract

We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent variant of counter abstraction, where thread counters are used in a program-context aware way. While designed for bounded counters, this method also integrates well with the Karp-Miller tree construction for vector addition systems, resulting in a reachability engine for programs with unbounded thread creation. The concurrent version of Boom is implemented using BDDs and includes partial order reduction methods. Boom is intended for model checking system-level code via predicate abstraction. We present experimental results for the verification of Boolean device driver models.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Gerard Basler
    • 1
  • Matthew Hague
    • 1
  • Daniel Kroening
    • 1
  • C. -H. Luke Ong
    • 1
  • Thomas Wahl
    • 1
  • Haoxian Zhao
    • 1
  1. 1.Oxford University Computing LaboratoryOxfordUnited Kingdom

Personalised recommendations