BOOM: taking boolean program model checking one step further

Authors:
Gerard Basler;Matthew Hague;Daniel Kroening;C.-H. Luke Ong;Thomas Wahl;Haoxian Zhao
Affiliations:
Oxford University Computing Laboratory, Oxford, United Kingdom;Oxford University Computing Laboratory, Oxford, United Kingdom;Oxford University Computing Laboratory, Oxford, United Kingdom;Oxford University Computing Laboratory, Oxford, United Kingdom;Oxford University Computing Laboratory, Oxford, United Kingdom;Oxford University Computing Laboratory, Oxford, United Kingdom
Venue:
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Year:
2010

Citing 8
Cited 2

Bebop: A Symbolic Model Checker for Boolean Programs

Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Parameterized Verification of Multithreaded Software Libraries

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Towards the Automated Verification of Multithreaded Java Programs

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A BDD-Based Model Checker for Recursive Programs

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Symbolic Counter Abstraction for Concurrent Software

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Reducing Context-Bounded Concurrent Reachability to Sequential Reachability

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
SAT-based summarization for Boolean programs

Proceedings of the 14th international SPIN conference on Model checking software
Expand, enlarge and check... made efficient

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification

Predicate abstraction and refinement for verifying multi-threaded programs

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
SatAbs: a bit-precise verifier for C programs

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

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.