Boom: Taking boolean program model checking one step further

Abstract

Abstract. We present Boom, an analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive replicated programs. Boom implements a recent variant of counter abstraction; efficiency is achieved using thread counters 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 Boolean programs with unbounded thread cre-ation. 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 exper-imental results for the verification of Boolean device driver models.